[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"a740509620516ffc64476f186594e5f4f3ac6b39e55c6ca763aa0222e2a4253d","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"a740509620516ffc64476f186594e5f4f3ac6b39e55c6ca763aa0222e2a4253d","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"3e87bcba0c5a59459ad0052bc72cdaa60b44ea510d818024fe220dfa0b1e4da6","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"3e87bcba0c5a59459ad0052bc72cdaa60b44ea510d818024fe220dfa0b1e4da6","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"bb35feae27bce9882b38d197db16ff3973b6f18458b2199361328daf412600fa","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"42cebdff3db13158834add4c637bc2d94c9055ef98234f6bbd7050cb28ae0532","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"e297f35f1970261a2523d8aaa0ba03ebb250cf10e209de0943a87d390e3fce26","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"a0ef2643d49685f77e34540d5d3763995f766dcc4e5ab39c744c926e7a624d2f","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"42e62693b8c667116dc936fa159b3f6740587af682d3f5db21205b763b39f921","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"aa3da22443159ebd56f081a47818341ea29b8572dfa98d15578c8b54ff0d77ca","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"705a94d43af81b062924cffef010b2657646daf0b38588f1e2de236f30d426c8","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"b797e5bc3fe207594e35442e4ef0cffc8bbfa68f80a53323d1c865bb22062108","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"811c93412b42667fcc54f28b3f2a8d0ffe38d3100d222ed5ff991ed78440dfa5","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"2269095750761886175e6750732a2a604e2fa2778ac46c0bf8064915b0c19e69","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"ecbacf99bf4ad990db92c99d413d0f695361270814c85609b4d815708cccd393","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"3d3328862511ccb2a57058242ac4293e4bebf5a075f34abfe85ebffc0813f223","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"d1dde7b94658ff8a1242d375aa126c81025a496f3d4ad75aa80ffb5dd2267825","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"0db92027660ca0aa21af169d0a7c49cbe68d404182129f4cec317c09a4a43226","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"6b6f468722a35448a9719f465cf261331b1a831f93b389a9052dcfb4827f3982","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"d834d7ecc09e190321e755669b459745ea247a14893b837ae120ab7948a5d033","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"e702380fb1b0b12d9a198895f57ac39610ccadd5b3474e61ad0e9233d5173b9a","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"1a59de7ab5019d47cbd6ed0901a3ea0d05ae03f1e368b68f6b325cb2305ca5e2","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"079becf7fbe829faa57db3727e9c2230ed3f91e13892aee218cf04eb6d549b2c","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"7baccd2bf9f9e5030bac2f0f734104104572242eb1d2dda2392fe3d100ccbb6a","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"c7297566cc2f55687bd9b9cde92915857588d0a78b46a9cb1963fc7e573e16a2","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"7d5b644b3e44366e1d9489f4bdd5fe51969963bc9b71aedd12375d3eb19dd3a6","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"2cf3df4da399f7946a8d450aedefaba2363244648362881518dac09898cb2683","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"5eb660269c2d8efd92589660a64515820fc876eec05422a4be64325e6441ae65","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"d4af3eac7a345fd0d685d15bf4594098f0bbdf02921cda74f346731939920bb7","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"1139f8a2b5d9b4d377fd27d4b097af80951a354e4879c9dc16c327435f217436","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"8fd027faab2955f52fb4e0674cbef07f30b6e8dbf44199689142c6ff287b9c90","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"4efbe281f7da90422b39e6d6c14bed28cde3b8e7d1bea6b2fe6e0bfc860e3dd7","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"c90ae481f7d0e8a13a087972fce4f5086ec863591e1f9c495030cbe25c8bceb3","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"ab401d54091f22736d6020ac8b05c27cc40a062c0b7dc11edd0b131e0d425913","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"f511823f308e74969988d308d4e24963019bae2f1bc5d1f76538ff1625992417","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"57d2a30055125336fb3aad16f5c141fcc8de79fe77236a8e1da9fcbcc7d3b4c4","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"283e1d0afd6cd59b2158cdefab106339f810e0e74c8691d5e5c6ff502c1f64a0","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"6548f1a28aa7b7601aa31ecd3becc41e1cb19fb7c4f8688c352d3e18a0fd13c6","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"52d5015f5fe783acc2c87bc860935197ac6e000a18d0d3ef9d1ec55fd1a41a6e","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"f0ed633a6afa001b494613a764ec4d48f015e04655e06972840e176aff5813f3","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"483ef24017e52a4a92b28783343991f628a5ded3dd874de52df3a26a5c21b5df","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"2610c9447d6e7160b7b3e9de7a72741804cde644600aa58affa876f38e1f0157","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"1e04e02cd5333f3ff40d09d5c2bebef9115fa65cbcdd59c696758e3c18b0c2ff","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"32c7b6f9778421984b35899a2947de9b195121c36564dbb33e6d9b24e349fed3","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"72cb597cb0caa106dc5d85cf2d656b3029ee85d9b59f0d261c5ba92bf10b353b","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"c570f7b3e61ad846d4e36ca1dfb7785164b9babb6eb88c795067d0d6503cd12b","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"e8794a1e26965fe561257e6707bfd6dcefc664398a486f83416d38f0afe7a3cf","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"ece5f1e5c7f82e9ec6c30cd819b10a4eeb0756aee61b3cd23d00669e0539edd3","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"5ccac52268238a80708411fc91b41d36725adba611d5b30a18644b29b12f7cd6","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"13a2d79d421a3aa2630a002839af0d98a8d887bbe20d01905eecfae6759afd45","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"833ad7adad5f75116a93c8642f33841aa09cce3e40b0d1b46f30eb0d32eaf323","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"946cc0ac7eb054eb30c15ac31b39eab1e8eea44ad8f20f08369760556a63aaac","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"3eea3d76858c8730247f4bb52798fc65f5d8e748759d07fda8c27fbd7493fa0e","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"7341805ef5096fa4d654359713b7e86a4f62fbafa702a3e9359523aea28ccfa7","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"47f1b000138ef5b9655e6c9276f90bdee33b595da7c1a17ca1afd6b18e717865","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"fe50ea48ca09d85eabb8718b82d6f650effcba57631095388cffb369d24fb16e","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"a2c6eadad2b622e44e17fcbd1f7736b3a6a97aff1aae70489aca82d2d3833928","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"2c3115e52a82425284117e911c3b17e8f012cd54ae49221d8f485f5fa357988e","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"4304857b54fe8dcb4608ec9cf0998ac447ee500103eedd29c926b1182d4accf2","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"89ecad176bf2f903b80bea0a95a91bb2d9a329af0156cea1a4ef7f3d39bfde6a","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"1420067d47f84b4da0549c95cb14f6bc77f045a6b8e29f38b92e51fb5beb8418","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"99e88cf601765d3bd8801f042777980844a7db8652ef61a5dcf12c637ea88466","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"3ebbdca755fe48538f9654b68012b18a687513c1377bb0a793ad13ac60a95567","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"10be86a9179504b13711b0d685f2dd92563dfaad6a4b9d655362b7af93f3983d","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"48392ac5903f7cb804199c31d0fd31c1c625f80ab870f60347cdbb475e2f0831","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"51cc3ff035959e81f3d432c32e7485b4f1a7ed7a93da87e313f5b78017f0be5d","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"e8794a1e26965fe561257e6707bfd6dcefc664398a486f83416d38f0afe7a3cf","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"72c8b34565f11d8bb2ac362c2efc4d48ae99c0f5404b407dad171cc8fb0fc077","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"e67b33081fd3fd743ebb4ae70e358476cb433a0f4726155e58405a163c0a3a85","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"23c7fb12dd2ac26e276fe7a63fbb84ee0c2eadd76aa56165b7f82a3b774064c7","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"1b934e7ecbed6c2041e723ebeb69e5b2d6cd48fce0a7286b93d04b95fcdf05d2","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"0289482215a13483c1fec955e1aca74246ff1d6a8a77d81a8e182c89b845d93d","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"076f986b3e1083efb858b216d47dd2c4d476bc540d70d1439e934937b360a851","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"662051cfe10cd0108fa110374e07e316a77d5cd7be08e526e3085d5a2182bed3","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"c9c56628d78de59e963442edd350aca88ae7984cfd5d8e07490ac5b4244aac50","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"712fae8a05716be6f8c4b120b85f758a46ca7596cb1ddbffa11f85c18268ac7f","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"c3f60b7c8e72a61d9d913294b3f2e7c255fb5ba8403d97977c978534e2ce0811","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"568f3b26e199d2f227ac1d03cf83db2073481f7c8c7b076e19694af70341311e","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"1f08b95870ca8293282857c4725279ae0455341b88b825999b3666a90e1e7529","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"d80f2128b8173baddbc25a59b8809862ead5262b910c7bbb557f657ad15c0b66","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"3a3b61e41d32e88ad623ba295e37e3addd3c8cdf630506776418a98c1a40e43d","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"47ddf3c4a4e2ced3d5731b6843d56d22aef678b486e67ce89d6807b8e0171013","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"44838e2c63811628a5970f92167bbc896c2ef6676bef4a8578d7fc8299076e73","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"a9d58555843d5c4b69fe25d136c38203bc065045accfd8336e55ad49a3e85ef8","course_id":"COMPSCI 577","course_uid":"course_de12e29109d0c90ee086fcec","catalog_version_id":"6f3b8da9dbde42e2f0c1bb102585eff8746d8d5ceb9e35088102380690dd939b","course_number":577,"subjects":["COMPSCI"],"title":"INTRODUCTION TO ALGORITHMS","description":"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. Computational intractability including typical NP-complete problems and ways to deal with them.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"}]