[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"aa484ad6f822fafa58651395cff66ea929b0eed18bf06e542ed89c2502ca26db","course_id":"COMPSCI 477","course_uid":"course_5c57df5be4f0510ce1caf740","catalog_version_id":"ff7149f7f17f30bc0e0d23bad7f5d1af51c0a1ef36bcca555dedc780b034fc00","course_number":477,"subjects":["COMPSCI"],"title":"ALGORITHMIC THINKING","description":"Use of algorithmic techniques for solving concrete computational problems. Incorporates elements of discrete mathematics and intermediate data structures. Introduction to basic paradigms for designing efficient algorithms: divide and conquer, dynamic programming, greed. Program development from nontrivial real-world problem descriptions, over precise specifications and algorithmic solutions, to implementation.","requirements_text":"Declared in the Capstone Certificate in Computer Sciences Kickstart Program for Professionals","official_learning_outcomes_json":"[]"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"aa484ad6f822fafa58651395cff66ea929b0eed18bf06e542ed89c2502ca26db","course_id":"COMPSCI 477","course_uid":"course_5c57df5be4f0510ce1caf740","catalog_version_id":"ff7149f7f17f30bc0e0d23bad7f5d1af51c0a1ef36bcca555dedc780b034fc00","course_number":477,"subjects":["COMPSCI"],"title":"ALGORITHMIC THINKING","description":"Use of algorithmic techniques for solving concrete computational problems. Incorporates elements of discrete mathematics and intermediate data structures. Introduction to basic paradigms for designing efficient algorithms: divide and conquer, dynamic programming, greed. Program development from nontrivial real-world problem descriptions, over precise specifications and algorithmic solutions, to implementation.","requirements_text":"Declared in the Capstone Certificate in Computer Sciences Kickstart Program for Professionals","official_learning_outcomes_json":"[]"},{"run_id":"20261014T203208-0851c9a1","semester":"1274","observed_at":"2026-10-14 17:50:09.728220+00:00","record_version_id":"3ed2a1869836d276bce38e23bed864a02a7585391ed0b49ea350f37672a002d4","course_id":"COMPSCI 477","course_uid":"course_5c57df5be4f0510ce1caf740","catalog_version_id":"3d4b153b6c889e8ed6b74083658974a49f2b791d1255b71c09992d3ef1f30d68","course_number":477,"subjects":["COMPSCI"],"title":"ALGORITHMIC THINKING","description":"Use of algorithmic techniques for solving concrete computational problems. Incorporates elements of discrete mathematics and intermediate data structures. Introduction to basic paradigms for designing efficient algorithms: divide and conquer, dynamic programming, greed. Program development from nontrivial real-world problem descriptions, over precise specifications and algorithmic solutions, to implementation.","requirements_text":"Declared in the Capstone Certificate in Computer Sciences Kickstart Program for Professionals","official_learning_outcomes_json":"[{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Formulate abstractions of computational problems.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Design and implement efficient algorithms based on the paradigms of divide and conquer, dynamic programming, and greed.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Analyze worst-case running times and memory requirements of algorithms using asymptotic notation.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Know, evaluate, and apply common algorithms and intermediate data structures dealing with numbers, strings, and graphs, understand their basic efficiency trade-offs and appropriate use cases.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Carry through the process of program development from nontrivial real-world problem descriptions, over precise specifications and algorithmic solutions, to implementations.\"}]"}]