{"assignment":{"_schema_version":2,"course_id":37,"date_created":"2022-06-28T19:00:00+00:00","date_modified":"2023-04-08T18:18:34.979935+00:00","extra_instructor_files":"","extra_starting_files":"","forked_id":null,"forked_version":null,"hidden":false,"id":1166,"instructions":"{\n  \"settings\": {\n    \"readingId\": \"bakery_time_complexity_read\"\n  },\n  \"questions\": {\n    \"Recall Program Evaluation Criteria\": {\n      \"type\": \"multiple_answers_question\",\n      \"points\": 1,\n      \"body\": \"What three criteria are commonly used to evaluate a program?\",\n      \"answers\": [\n        \"How readable the program is.\",\n        \"Whether the program uses enough loops.\",\n        \"How fast the program is.\",\n        \"How clever the program is.\",\n        \"Whether the program is correct.\",\n        \"How many lines of code are in the program.\"\n      ]\n    },\n    \"Define Program Measurement Methods\": {\n      \"type\": \"matching_question\",\n      \"points\": 1,\n      \"body\": \"Match each description to its most accurate label.\",\n      \"answers\": [\n        \"Wall Clock Time\",\n        \"RAM Model\",\n        \"Lines of Code\",\n        \"Quadratic Growth\",\n        \"Time Equation\",\n        \"Random Guessing\"\n      ],\n      \"statements\": [\n        \"Measuring the actual time taken by the program.\",\n        \"Estimating the time each statement of a program will take via a simplified model of execution.\",\n        \"The number of statements in the program.\"\n      ]\n    },\n    \"Order Time Complexity\": {\n      \"type\": \"matching_question\",\n      \"points\": 1,\n      \"body\": \"Put these mathematical relationships in order from slowest to fastest growth relative to each other.\",\n      \"answers\": [\n        \"Constant\",\n        \"Linear\",\n        \"Quadratic\"\n      ],\n      \"statements\": [\n        \"Fastest\",\n        \"In-between\",\n        \"Slowest\"\n      ]\n    },\n    \"Identify Time Complexity of Problems\": {\n      \"type\": \"matching_question\",\n      \"points\": 1,\n      \"body\": \"Mark each of the following as either constant, linear, or quadratic based on the size of the input. You can assume that we are talking about the worst possible input for each possible given size input.\",\n      \"answers\": [\n        \"constant\",\n        \"linear\",\n        \"quadratic\"\n      ],\n      \"statements\": [\n        \"Adding together three numbers.\",\n        \"Adding up a list of numbers.\",\n        \"Doubling every element of a list.\",\n        \"Checking to see if a list contains a negative number.\",\n        \"Getting the first and last elements of a list and adding them together.\",\n        \"Getting the first element of each row of a 2-dimensional list.\",\n        \"Check to see if a certain number is in a 2-dimensional list.\" \n      ]\n    }\n  }\n}","ip_ranges":"","name":"11A1) Time Complexity","on_change":"","on_eval":"","on_run":"","owner_id":1,"owner_id__email":"acbart@udel.edu","points":1,"public":true,"reviewed":false,"sample_submissions":[],"settings":"","starting_code":"","subordinate":false,"tags":[],"type":"quiz","url":"bakery_time_complexity_quiz","version":5},"ip":"216.73.216.157","submission":{"_schema_version":3,"assignment_id":1166,"assignment_version":5,"attempts":0,"code":"","correct":false,"course_id":37,"date_created":"2026-05-20T12:42:01.018037+00:00","date_due":"","date_graded":"","date_locked":"","date_modified":"2026-05-20T12:42:01.018037+00:00","date_started":"","date_submitted":"","endpoint":"","extra_files":"","feedback":"","grading_status":"NotReady","id":2036760,"score":0.0,"submission_status":"Started","time_limit":"","url":"submission_url-a5a7e108-c64f-4a5c-9a8e-0b29beb228f7","user_id":2044660,"user_id__email":"","version":0},"success":true}