[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"ea241400ec78cc47e6f26806d268b633f16d636170978d446cc44ad7dc3dec7a","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"1a6121fa01adc2066577459eca358359b833e16f9dc4604f383655b06b61115d","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217 or221","official_learning_outcomes_json":"[]"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"ea241400ec78cc47e6f26806d268b633f16d636170978d446cc44ad7dc3dec7a","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"1a6121fa01adc2066577459eca358359b833e16f9dc4604f383655b06b61115d","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217 or221","official_learning_outcomes_json":"[]"},{"run_id":"20261014T203208-0851c9a1","semester":"1274","observed_at":"2026-10-14 17:50:09.728220+00:00","record_version_id":"85a25f9f678c3802f5313285020c5031a8ff482027b208b69f963103be8266e4","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"17060227f01f25781c957bb55c224e7c01f3ce9aef82fc4b002c087bb400a755","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217 or221","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\":\"Demonstrate proficiency with basic skills for constructing and evaluating mathematically rigorous arguments and proofs.\"},{\"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\":\"Construct proofs by induction to prove properties in a variety of domains (mathematical formulas, recursively-defined structures, loop invariants, program correctness).\"},{\"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\":\"Demonstrate a familiarity with and an ability to reason about discrete structures/data types (integers, strings, bit strings, sets, relations, functions, graphs, trees).\"},{\"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\":\"Employ basic program analysis techniques to evaluate behavior of functions and simple algorithms such as assessing correctness and termination of simple algorithms, constructing recurrences, solving simple recurrences, and applying asymptotic analysis.\"},{\"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\":\"Apply basic combinatoric techniques to counting 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\":\"Demonstrate the connections between a description of a simple language and a finite state machine or regular expression. Given a finite state machine or regular expression, determine the language it defines and/or whether a given string is recognized by it. Given a simple language, construct a finite state machine or regular expression that recognizes it.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Demonstrate proficiency with basic skills for constructing and evaluating mathematically rigorous arguments and proofs.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Construct proofs by induction to prove properties in a variety of domains (mathematical formulas, recursively-defined structures, loop invariants, program correctness).\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Demonstrate a familiarity with and an ability to reason about discrete structures/data types (integers, strings, bit strings, sets, relations, functions, graphs, trees).\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Employ basic program analysis techniques to evaluate behavior of functions and simple algorithms such as assessing correctness and termination of simple algorithms, constructing recurrences, solving simple recurrences, and applying asymptotic analysis.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Apply basic combinatoric techniques to counting problems.\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Demonstrate the connections between a description of a simple language and a finite state machine or regular expression. Given a finite state machine or regular expression, determine the language it defines and/or whether a given string is recognized by it. Given a simple language, construct a finite state machine or regular expression that recognizes it.\"}]"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"d0f9153ad08ef0ea6d04681975308bf9cb95369299c0021d344e69bf2e98ce1d","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"d0f9153ad08ef0ea6d04681975308bf9cb95369299c0021d344e69bf2e98ce1d","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"fd6e9bdf0da2e5542f9084c53fa287ad9e2d3e2c51619525106433de7cb79c8d","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"7b39315c777d2c8d9a3b4781414c7f7787643c0ab2723d9297531f1b31c0e57d","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"bbc4b433a79264a6d4bf8b9fbca4346b98cfafd1077b9b646dcaec00c56e35bb","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"3628173880a9e39248f4a4529319fc4d451235394dc50633ee5c2b88fe9da5f9","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"d4a9ee4e2cead1886fb3cc0b66778d3bfbeb42e58da8566f11d1ace5b83c00a8","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"e5251fd253a5980316dae098fb960bfdc11e4577a8ed51354cfbccc454b97f0a","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"1a6121fa01adc2066577459eca358359b833e16f9dc4604f383655b06b61115d","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217 or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"f3733c000d2810c0bcacac37ecd3da1e1abe7ff52f5bcddc0646abcf7ac97f2a","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"ca9e17417d6f043ce19d8605297d149dea9a35cc712b0938a6b834c171bf99fd","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"2582c14d0f77028684bd35bc6d48b466470741b779acf3073c85087320793256","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"374269b27aacc9d469ce96501ce28dff88e08df0234ac4d558511c0fc088845c","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"cb14c0c9774b5d3b459fb50a73381dc1f0c2389cda97e12431b4c8cae10616fa","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"c6b64c9b26cd46470a2f62dfa1681aad5fabd18a04973397ed3954f2f48aa33a","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"f4d9031d20279f44d89c3a4a386a3f1e659f23510689a0f6c0edfd77a4a1664e","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"470cee2cdd5d231139f76e74ac037878d513af333aee2596c4fd5103741f8137","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"978fc05aca504303d0193715069861d8ffab9f97adabcdd5cfec5bd253d2c22f","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"fdef51639fa9e5303bd006708645369efa9f1f0dabf88c8b811787988f79e60c","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"6068dfea994d9363f3f184ec276e4de8fdcb9edd4c4e9a427ce29aed398fafa6","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"7907e63c1124ea72aaf438e8a037e4a158785c4224ae2c9e0fb03931fd60d2c3","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"5cf6ef3fc102651ac0fedacf6e6d8bc43f43236f09b70d02d525fe11c5636b72","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"66b0841fb60a44fcdb99ab41abb7152e3f15080b428944fd0b56767373a6ee83","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"e9b072b60da536553a5410a8143ea4b6c190c3b72dd6cb351c1857c82512300b","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"ef58bb7f870c46372811b9753bc270839ae8d8704aa0e6a765ee8fbd820b0a4f","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"bc8e8c1f6512fb66ecb3e087e25341618af0913ca1f38ffd92dd4c6659348986","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"b538df83c22816b43219176225c5282c2d638c1c6d32918b4284646a53b158f4","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"a44fe14e0c35029fc38eff7c799ad5d9912b90ec94864a914f1fa9dab26ef50e","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"3a1b86d69304927e47c4cfbada4dee572fcfab64c92da125ce5254197af5a004","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"b77c158eda61110ffe64ae3f829cfb7aba4edbe14c77cfd62e2b47fca7bca5b7","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"22a0c2abe43e92c52783b3d95f8de3d75d01b837af3600a0731b9325ec00329c","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"99362bd39e771cec35cc77fd6cae60294614517d1d9cf7293163a992351ab99d","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"280904cc30f4b1d93ca0a1d81b0134c377df3826173a060ef17dde333a7fad94","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"b05fa38323f4ef00318f5d3fd40e5a0510bb598acd7c9e4a19c018c0b84a7bd7","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"98d3d7013c885c3ec9c83c53f216a40b32df3651e8cec94bfb30ab9f12ba0f38","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"c8d4a6b144245829db0cf1a699778d3c7693971ed78dff8bdd4d343e5ed46c63","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"d202b7ead83dc2d7b0ff58961d541827e68a232812b7d1452bcf00d71fbba1c2","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"8ec44cbc733c50d2daf03e9b5900ef973b486703cc2e3c6134295e86719c99bd","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"2a3945d01f30f3286363251ff21cf40088cae72bc470198235c0a6d12635bf4a","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"257520567688ac7c4f5af3e0aab8e60055eb6419607c81d89e638a3a006d796a","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"4522b36800473e2250cee39d92711f0c32b5ccc2fb4bb165caaaa21724b7cf18","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"bb355fb08f951e4a02b87673ef82e3c93a55a9d148a67259f5c03621b26b0ecb","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"c2e8547e00c1e6d4126a2acdf53c8b3b426e4c000ac27b45d96d918616a17eb1","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"dd65143cd0327e4fad245e9ecee71e9642ab9b02e234e9b87384401591da0b76","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"5b4ba2515916e137fb18e349a20d7cc9dc2db174fdfe4eb029478ffca562bd88","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"173858fd8d3e1715d85f2ea3581e8fb3a591f70f2c9cdb54087f8d5ade5f2470","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"5131f3621aede54fa7f0931c91b1b5ea2b0f4ee28b1ce9c1f83ad17d44527ef6","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"d895877415628c004f8e4961074b83e21f4315ac1373019ab91b54c5157e5c6b","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"24fa4017e45e17409caaf1aa5ac9db0144e0117704d540c8e594e42428d1bddb","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"1c4847e51baf7e58ae12651236361152677a6233d90fe05da8a361f913824ee6","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"3e959dc61b91c3b79506496edcbff63c19a5459f28b41ebb8f05cd0fc9c4893a","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"c53d52b2ed486a3821ccccfa74d7bb44c7c782102a5804cffd332735219dec22","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"faad04f6d9b84a753c1e5773bf2a3d6b4c9e30b33aba1f967591f91761d535e4","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"6b2e0ab2e116f7711999f9ef93a060458c98ec7158b725ae70a1384094f85a48","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"2710f809aa0388e7cf2a0e7f87f038ebbadeebfa79b76e4a50afe1abe5f6c798","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"df55ee2233606470c481b4965f4f18b74e5282b749d6f35f8f8f004a972f9d33","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"d8433ed2ba52978c328eca4d1d0809c58d261812fdfe815c843afcff6382fad5","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"f79dcd651fe082ef89a9d1c0d6f20a067257442fcd814192d281b8a27c53cb5b","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"61ab7a558f15a6ca41ba5ded314a0c53ccf38684ab1cc24a55e706600e8a5094","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"70c5fbfa2ed3ea74eaa0bf0c780ff2542b2d6985b1cd974e678a25e048f6c6ca","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"4788022d8e131f018b8965c942057a73ab6e167245fb66bc7584aabf630a1042","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"70d7eb5f1ee4b86ca92618ab1782f9dc9743131b694dbb744cc3651b00f82fcd","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"125b3ea7af4fb5978331cfb0943415ef5b4d691a8c1aca05b0d990ebc1a2eeda","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"56f2070bfdba76873188d16508cd4ec0a752f4808cb8bd6d60cef3b5b98db71e","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"208288df6f69456643a86534f4969769e7fb42e304c3a9a8835aae5f72c5c25c","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"173858fd8d3e1715d85f2ea3581e8fb3a591f70f2c9cdb54087f8d5ade5f2470","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"a132748c6e8ea45bb9ddf14f45991e0d4ceeecb98ac0d888d529c1d931b1d3f1","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"e17f5b7ef64096e73de7d4fc8376abdb606b55e95527b940b6755c5b443b3f3c","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"0d6825d882753c30ff9aeaa0ad3fcecd243ce286df7f3b26914b089778f745bf","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"80e3c63f57b969ffc50e0a8f3b4d8deee1080370eb7d3969ecc22c3a5b98c489","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"db51094c9ca1887c4e26b7bad871e7f1b1fc04e91166401ab26be74e9b0c7fca","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"527191c99be9ee0e37a75976eede20fb84481826d66ff29b8033df497356f9ce","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"95c9efc570b84b22bbaf0387a2a55d53a0099444e38060a2812f23abf9567ca2","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"562db5070c36f909c4c0e2cd9221000dc8c45c293e10412a06e416632f0aa5e5","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"fa725c76878e60b64dbbb760aa9cc8d1b0a985846c1608fa3ec1d400dbd762f4","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"35f7a34137fbc0ca80afd63d0fa800d784a3bb2894ca96765e71878cbda2ba25","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"b6b0ee6a5bab8edab5effc0b674456af5bf06213c73a6c7b139e8917d9465d1f","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"3f99ced442e30b3e969f009b65e900a08b398c0c57391ac275366fb7485c117e","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"03e7ffccab325b1667314667b83af59d7e2e82e133847db572b9d24766242e16","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"8868245ca88ae05fab5d80dc368fc3f5fbf70956c01d31142a6fc0888818c046","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"23a82f0d1bd0ce623d5609439849a354b854ee835ce65fb4832f730c8968c469","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"7a3aee8cc660b39997c1bd387a14c31f594be88b14a67315c8f2a26e7cf138f3","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"0eff2179488408d1369e43e808d0ba1b0741787190e6597507e271afc5945ee8","course_id":"COMPSCI/MATH 240","course_uid":"course_9a1a7bf1933981bcbaca47ac","catalog_version_id":"a34d4a195743b7b85aeeaae837f80785905874885e6db286832c9b7a2507cd8a","course_number":240,"subjects":["COMPSCI","MATH"],"title":"INTRODUCTION TO DISCRETE MATHEMATICS","description":"Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs.  Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting.","requirements_text":"MATH 217or221","official_learning_outcomes_json":"[]"}]