{"schema_version":1,"url":"https://uwcourses.com/departments/COMPSCI/hardest?term=1274","title":"Hardest courses in Computer Sciences | UW–Madison","dataset":{"search_projection":{"version":1,"terms":["1274","1272","1264","1262","1254","1252","1244","1242","1234","1232","1224","1222","1212","1204","1202","1194","1192","1184","1182","1174","1172","1164","1162","1154","1152","1144","1142","1134","1132","1124","1122","1114","1112","1104","1102","1094","1092","1084","1082","1074","1072"]},"revision":"fc1811fa52e581ea57a35c0cf3343f8740a8ffbf","repository":"twangodev/uwcourses","schema_version":6,"importer_version":"10","projection_id":"25a5e1495a940a130efa223858e76f52294bba73a112cecf25208173491bd201","observed_at":"2026-10-14T17:50:09.728220+00:00","built_at":"2026-10-19T18:58:33.786556+00:00","courses":8929,"current_instructors":3758,"limited":false,"terms":["1274","1272","1264","1262","1254","1252","1244","1242","1234","1232","1224","1222","1212","1204","1202","1194","1192","1184","1182","1174","1172","1164","1162","1154","1152","1144","1142","1134","1132","1124","1122","1114","1112","1104","1102","1094","1092","1084","1082","1074","1072"],"term":"1274","departments":[{"subject":"AAE","count":90},{"subject":"ABT","count":20},{"subject":"ACCTIS","count":36},{"subject":"ACTSCI","count":14},{"subject":"AFAERO","count":10},{"subject":"AFRICAN","count":87},{"subject":"AFROAMER","count":70},{"subject":"AGROECOL","count":21},{"subject":"AMERIND","count":54},{"subject":"ANAT&PHY","count":7},{"subject":"ANATOMY","count":2},{"subject":"ANESTHES","count":8},{"subject":"ANSCI","count":53},{"subject":"ANTHRO","count":93},{"subject":"ART","count":124},{"subject":"ARTED","count":10},{"subject":"ARTHIST","count":121},{"subject":"ASIALANG","count":129},{"subject":"ASIAN","count":109},{"subject":"ASIANAM","count":28},{"subject":"ASTRON","count":38},{"subject":"ATMOCN","count":70},{"subject":"BIOCHEM","count":52},{"subject":"BIOCORE","count":10},{"subject":"BIOLOGY","count":14},{"subject":"BIOMDSCI","count":18},{"subject":"BME","count":66},{"subject":"BMI","count":41},{"subject":"BMOLCHEM","count":10},{"subject":"BOTANY","count":68},{"subject":"BSE","count":44},{"subject":"C&ESOC","count":73},{"subject":"CBE","count":48},{"subject":"CHEM","count":101},{"subject":"CHICLA","count":51},{"subject":"CIVENGR","count":131},{"subject":"CLASSICS","count":47},{"subject":"CNP","count":11},{"subject":"CNSRSCI","count":49},{"subject":"COMARTS","count":137},{"subject":"COMPBIO","count":15},{"subject":"COMPLIT","count":10},{"subject":"COMPSCI","count":138},{"subject":"COUNPSY","count":78},{"subject":"CRB","count":14},{"subject":"CS&D","count":71},{"subject":"CSCS","count":39},{"subject":"CURRIC","count":193},{"subject":"DANCE","count":93},{"subject":"DERM","count":8},{"subject":"DS","count":88},{"subject":"DYSCI","count":33},{"subject":"ECE","count":155},{"subject":"ECON","count":144},{"subject":"EDPOL","count":115},{"subject":"EDPSYCH","count":97},{"subject":"ELPA","count":71},{"subject":"EMA","count":52},{"subject":"EMERMED","count":17},{"subject":"ENGL","count":205},{"subject":"ENTOM","count":39},{"subject":"ENVIRST","count":149},{"subject":"EP","count":15},{"subject":"EPD","count":65},{"subject":"ESL","count":15},{"subject":"F&WECOL","count":60},{"subject":"FAMMED","count":21},{"subject":"FINANCE","count":50},{"subject":"FOLKLORE","count":38},{"subject":"FOODSCI","count":43},{"subject":"FRENCH","count":62},{"subject":"GEN&WS","count":144},{"subject":"GENBUS","count":72},{"subject":"GENECSLR","count":17},{"subject":"GENETICS","count":60},{"subject":"GEOG","count":112},{"subject":"GEOSCI","count":83},{"subject":"GERMAN","count":84},{"subject":"GLE","count":47},{"subject":"GNS","count":39},{"subject":"GREEK","count":27},{"subject":"HDFS","count":43},{"subject":"HEBR-BIB","count":13},{"subject":"HEBR-MOD","count":10},{"subject":"HISTORY","count":232},{"subject":"HISTSCI","count":54},{"subject":"HONCOL","count":13},{"subject":"ILS","count":43},{"subject":"INFOSYS","count":9},{"subject":"INTEGART","count":7},{"subject":"INTEGSCI","count":22},{"subject":"INTER-AG","count":18},{"subject":"INTER-HE","count":11},{"subject":"INTER-LS","count":21},{"subject":"INTEREGR","count":16},{"subject":"INTLBUS","count":21},{"subject":"INTLST","count":52},{"subject":"ISYE","count":82},{"subject":"ITALIAN","count":55},{"subject":"JEWISH","count":56},{"subject":"JOURN","count":87},{"subject":"KINES","count":127},{"subject":"LACIS","count":26},{"subject":"LANDARC","count":61},{"subject":"LATIN","count":24},{"subject":"LAW","count":118},{"subject":"LEGALST","count":48},{"subject":"LINGUIS","count":35},{"subject":"LIS","count":90},{"subject":"LITTRANS","count":79},{"subject":"LSC","count":52},{"subject":"M&ENVTOX","count":7},{"subject":"MARKETNG","count":65},{"subject":"MATH","count":152},{"subject":"MDGENET","count":8},{"subject":"ME","count":132},{"subject":"MEDHIST","count":41},{"subject":"MEDICINE","count":59},{"subject":"MEDIEVAL","count":32},{"subject":"MEDPHYS","count":39},{"subject":"MEDSC-M","count":29},{"subject":"MEDSC-V","count":45},{"subject":"MHR","count":68},{"subject":"MICROBIO","count":45},{"subject":"MILSCI","count":16},{"subject":"MM&I","count":22},{"subject":"MOLBIOL","count":6},{"subject":"MS&E","count":60},{"subject":"MUSIC","count":164},{"subject":"MUSPERF","count":125},{"subject":"NAVSCI","count":20},{"subject":"NE","count":44},{"subject":"NEURODPT","count":11},{"subject":"NEUROL","count":7},{"subject":"NEURSURG","count":5},{"subject":"NTP","count":11},{"subject":"NURSING","count":112},{"subject":"NUTRSCI","count":64},{"subject":"OBS&GYN","count":18},{"subject":"OCCTHER","count":39},{"subject":"ONCOLOGY","count":13},{"subject":"OPHTHALM","count":5},{"subject":"OTM","count":44},{"subject":"PATH","count":34},{"subject":"PATH-BIO","count":29},{"subject":"PEDIAT","count":27},{"subject":"PHARMACY","count":36},{"subject":"PHILOS","count":76},{"subject":"PHMCOL-M","count":10},{"subject":"PHMPRAC","count":41},{"subject":"PHMSCI","count":58},{"subject":"PHYASST","count":38},{"subject":"PHYSICS","count":88},{"subject":"PHYSIOL","count":3},{"subject":"PHYTHER","count":37},{"subject":"PLANTSCI","count":53},{"subject":"PLPATH","count":37},{"subject":"POLISCI","count":197},{"subject":"POPHLTH","count":54},{"subject":"PORTUG","count":33},{"subject":"PSYCH","count":102},{"subject":"PSYCHIAT","count":21},{"subject":"PUBAFFR","count":54},{"subject":"PUBLHLTH","count":23},{"subject":"RADIOL","count":11},{"subject":"REALEST","count":41},{"subject":"RELIGST","count":90},{"subject":"RHABMED","count":9},{"subject":"RMI","count":24},{"subject":"RP&SE","count":101},{"subject":"S&APHM","count":16},{"subject":"SCANDST","count":73},{"subject":"SLAVIC","count":90},{"subject":"SOC","count":145},{"subject":"SOCWORK","count":87},{"subject":"SOILSCI","count":46},{"subject":"SPANISH","count":81},{"subject":"SRMED","count":21},{"subject":"STAT","count":91},{"subject":"STDYABRD","count":52},{"subject":"STS","count":8},{"subject":"SURGERY","count":24},{"subject":"SURGSCI","count":33},{"subject":"THEATRE","count":88},{"subject":"URBRPL","count":60},{"subject":"UROLOGY","count":6},{"subject":"ZOOLOGY","count":90}],"designations":[{"family":"breadth","value":"biological-science","label":"Breadth - Biological Science"},{"family":"breadth","value":"biological-science-or-social-science","label":"Breadth - Biological Science or Social Science"},{"family":"breadth","value":"humanities","label":"Breadth - Humanities"},{"family":"breadth","value":"humanities-or-natural-science","label":"Breadth - Humanities or Natural Science"},{"family":"breadth","value":"humanities-or-social-science","label":"Breadth - Humanities or Social Science"},{"family":"breadth","value":"literature","label":"Breadth - Literature"},{"family":"breadth","value":"natural-science","label":"Breadth - Natural Science"},{"family":"breadth","value":"physical-science","label":"Breadth - Physical Science"},{"family":"breadth","value":"social-science","label":"Breadth - Social Science"},{"family":"breadth","value":"social-science-or-natural-science","label":"Breadth - Social Science or Natural Science"},{"family":"catalog-level","value":"advanced","label":"Level - Advanced"},{"family":"catalog-level","value":"elementary","label":"Level - Elementary"},{"family":"catalog-level","value":"intermediate","label":"Level - Intermediate"},{"family":"communication","value":"a","label":"Comm QR - Communication A"},{"family":"communication","value":"b","label":"Comm QR - Communication B"},{"family":"core-gened","value":"civics-and-perspectives","label":"Core GenEd - Civics & Perspectives"},{"family":"core-gened","value":"communication-and-literacy","label":"Core GenEd - Communication & Literacy"},{"family":"core-gened","value":"humanities-and-arts","label":"Core GenEd - Humanities & Arts"},{"family":"core-gened","value":"mathematics-and-quantitative-reasoning","label":"Core GenEd - Mathematics & Quantitative Reasoning"},{"family":"core-gened","value":"natural-science-and-wellness","label":"Core GenEd - Natural Science & Wellness"},{"family":"core-gened","value":"natural-science-and-wellness-lab","label":"Core GenEd - Natural Science & Wellness + Lab"},{"family":"core-gened","value":"social-and-behavioral-science","label":"Core GenEd - Social & Behavioral Science"},{"family":"ethnic-studies","value":"yes","label":"Ethnic St - Ethnic Studies"},{"family":"frgn-lang","value":"1st-semester-language","label":"Frgn Lang - 1st semester language"},{"family":"frgn-lang","value":"2nd-semester-language","label":"Frgn Lang - 2nd semester language"},{"family":"frgn-lang","value":"3rd-semester-language","label":"Frgn Lang - 3rd semester language"},{"family":"frgn-lang","value":"4th-semester-language","label":"Frgn Lang - 4th semester language"},{"family":"frgn-lang","value":"5th-semester-language","label":"Frgn Lang - 5th + semester language"},{"family":"graduate-credit","value":"yes","label":"Grad 50% - Counts toward 50% graduate coursework requirement"},{"family":"honors","value":"accelerated-honors","label":"Honors - Accelerated Honors (!)"},{"family":"honors","value":"honors-only-courses-h","label":"Honors - Honors Only Courses (H)"},{"family":"honors","value":"honors-optional","label":"Honors - Honors Optional (%)"},{"family":"liberal-arts","value":"l-and-s-liberal-arts-and-science","label":"L&S Credit - L&S Liberal Arts and Science"},{"family":"quantitative-reasoning","value":"a","label":"Comm QR - Quantitative Reasoning A"},{"family":"quantitative-reasoning","value":"b","label":"Comm QR - Quantitative Reasoning B"},{"family":"workplace","value":"workplace-experience","label":"Workplace - Workplace Experience"}],"deployed_at":"2026-10-21T15:26:46.388253+00:00","site_commit":"daa1fadde432744ba417ff2b9999b11224ddd967"},"data":{"subject":"COMPSCI","collection":"hardest","results":{"total":52,"page":1,"q":"","term":"1274","availability":"offered","instructor_name":null,"filters":{"term":"1274","ranking":"hardest","subject":"COMPSCI"},"kind":"course","items":[{"course_uid":"course_de12e29109d0c90ee086fcec","course_id":"COMPSCI 577","title":"INTRODUCTION TO ALGORITHMS","credits_min":4,"credits_max":4,"gpa":3.04,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 2.82 GPA across 501 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_577#grades"}]}],"description":"This course covers core algorithm-design paradigms and computational intractability.","discovery":{"term":"1274","offered":true,"history":{"counts":[1057,609,865,528,471,299,59],"count":3888,"gpa":2.9618055555555554,"topShare":42.849794238683124,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_de12e29109d0c90ee086fcec","uid":"instructor_5b07ff954db288ff1052dd87","name":"Marc Renault","quality":2.4714035723932413,"quality_count":168,"instructor_url":"/instructors/MARC_RENAULT"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"One student found the lectures had almost no correlation to the homework, creating the feeling of taking two separate classes and requiring significant extra effort to connect the material.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2316450","source_review_id":"UmF0aW5nLTQxNzM2MDAw","instructor_name":"Marc Renault","review_date":"2025-10-20 23:26:55 +0000 UTC","review_id":"0ee7d5df38a41b0bd93bd54b","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2316450"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_de12e29109d0c90ee086fcec-0.json"]}},{"course_uid":"course_a04e8d794b24e3b81b984774","course_id":"COMPSCI/ISYE/MATH/STAT 525","title":"LINEAR OPTIMIZATION","credits_min":3,"credits_max":3,"gpa":2.977,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.13 GPA across 52 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_ISYE_MATH_STAT_525#grades"}]}],"description":"Linear Optimization covers problems with linear inequality constraints, emphasizing formal proofs, the simplex method's theory, duality, and theorems of the alternatives.","discovery":{"term":"1274","offered":true,"history":{"counts":[151,77,114,52,81,22,9],"count":506,"gpa":3.022727272727273,"topShare":45.059288537549406,"firstTerm":"1232","lastTerm":"1264"},"instructors":[],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Homeworks were extremely hard at times, though the total volume was limited to eight assignments. The workload is demanding due to the difficulty of the problems rather than the quantity.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2371667","source_review_id":"UmF0aW5nLTI5OTk1NDQ5","instructor_name":"Carla Michini","review_date":"2018-05-05 13:47:02 +0000 UTC","review_id":"b6627fccbcc4b01467d779dc","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2371667"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_a04e8d794b24e3b81b984774-0.json"]}},{"course_uid":"course_145b404f135a123b8323fd02","course_id":"COMPSCI/MATH 513","title":"NUMERICAL LINEAR ALGEBRA","credits_min":3,"credits_max":3,"gpa":3.086,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.04 GPA across 63 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_MATH_513#grades"}]}],"description":"Covers direct and iterative solutions for linear/nonlinear systems and eigenproblems, including LU/QR factorizations, least squares, and algorithmic stability.","discovery":{"term":"1274","offered":true,"history":{"counts":[71,29,29,20,18,14,4],"count":185,"gpa":3.0945945945945947,"topShare":54.054054054054056,"firstTerm":"1234","lastTerm":"1264"},"instructors":[{"course_uid":"course_145b404f135a123b8323fd02","uid":"instructor_f4e74e07ce1d40bc1a7b1e58","name":"Yue Sun","quality":null,"quality_count":0,"instructor_url":"/instructors/YUE_SUN"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"One past student said Amos Ron’s homeworks were 10–15 pages biweekly. Another said the homework took many hours and lectures met three days a week for 75 minutes.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1190420","source_review_id":"UmF0aW5nLTI5NzM2OTk2","instructor_name":"Amos Ron","review_date":"2018-04-03 20:18:45 +0000 UTC","review_id":"a70c46954c02dbf4ed040c60","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1190420"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1190420","source_review_id":"UmF0aW5nLTMxODIwODg5","instructor_name":"Amos Ron","review_date":"2019-05-09 04:01:31 +0000 UTC","review_id":"7ec4bbcc007fd536dc1311df","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1190420"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_145b404f135a123b8323fd02-0.json"]}},{"course_uid":"course_6e524f2d6f14b4e14c7ac770","course_id":"COMPSCI/ECE 354","title":"MACHINE ORGANIZATION AND PROGRAMMING","credits_min":3,"credits_max":3,"gpa":3.098,"badges":[{"id":"rated-teacher","tag":"rated-teacher","label":"Highly rated instructor","tone":"positive","evidence":"Spring 2027: Hina Mahmood (4.27/5 adjusted; 47 ratings). At least one assigned instructor qualifies. This describes instructor reviews across courses, not a course rating.","sources":[{"label":"Hina Mahmood","href":"/instructors/HINA_MAHMOOD"}]},{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.13 GPA across 618 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_ECE_354#grades"}]}],"description":"Machine Organization and Programming introduces computer system structures and C programming, focusing on low-level performance impacts like virtual memory, caching, and assembly.","discovery":{"term":"1274","offered":true,"history":{"counts":[1058,892,1432,619,331,95,39],"count":4466,"gpa":3.1246081504702192,"topShare":43.66323331840573,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_6e524f2d6f14b4e14c7ac770","uid":"instructor_cce649041a2db573b9b63872","name":"Hina Mahmood","quality":4.270057785222827,"quality_count":47,"instructor_url":"/instructors/HINA_MAHMOOD"},{"course_uid":"course_6e524f2d6f14b4e14c7ac770","uid":"instructor_3aacf95596af43ab576afe0c","name":"Gary Dahl","quality":3.2170506949138824,"quality_count":155,"instructor_url":"/instructors/GARY_DAHL"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Projects were lengthy and required students to start early, while exams were fair and mostly theoretical.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/3056362","source_review_id":"UmF0aW5nLTQwNTMwMTQ1","instructor_name":"Hina Mahmood","review_date":"2025-01-12 01:00:23 +0000 UTC","review_id":"17f9c910a70bf30c29b0ab0f","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:3056362"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_6e524f2d6f14b4e14c7ac770-0.json"]}},{"course_uid":"course_20918224366f6bbd226f8ec0","course_id":"COMPSCI 536","title":"INTRODUCTION TO PROGRAMMING LANGUAGES AND COMPILERS","credits_min":3,"credits_max":3,"gpa":3.103,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 2.99 GPA across 65 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_536#grades"}]}],"description":"Introduction to the theory and practice of compiler design, comparing programming language features and their implementation implications through required programming projects.","discovery":{"term":"1274","offered":true,"history":{"counts":[211,117,119,56,40,27,21],"count":591,"gpa":3.1429780033840946,"topShare":55.499153976311334,"firstTerm":"1234","lastTerm":"1264"},"instructors":[{"course_uid":"course_20918224366f6bbd226f8ec0","uid":"instructor_4203105772ea81866ef79afc","name":"Charles Yuan","quality":null,"quality_count":0,"instructor_url":"/instructors/CHARLES_YUAN"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Exams and projects were difficult, but the criteria for success were described as super clear.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/384064","source_review_id":"UmF0aW5nLTM4Nzg5NDIz","instructor_name":"Beck Hasti","review_date":"2023-12-24 20:01:27 +0000 UTC","review_id":"c8b18c3104476f5a810b2962","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:384064"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_20918224366f6bbd226f8ec0-0.json"]}},{"course_uid":"course_2e71825a82859020279c78b8","course_id":"COMPSCI/ECE/MATH 435","title":"INTRODUCTION TO CRYPTOGRAPHY","credits_min":3,"credits_max":3,"gpa":3.066,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.15 GPA across 84 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_ECE_MATH_435#grades"}]}],"description":"Introduction to cryptography covering secure transmission of digital information, distinguishing perfect from computational security, and introducing technical aspects.","discovery":{"term":"1274","offered":true,"history":{"counts":[213,153,210,105,63,13,12],"count":769,"gpa":3.1456436931079326,"topShare":47.594278283485046,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_2e71825a82859020279c78b8","uid":"instructor_59b2c46efd070837d1d31f7d","name":"Rishab Goyal","quality":3.3394623869976465,"quality_count":10,"instructor_url":"/instructors/RISHAB_GOYAL"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Homeworks were difficult but interesting to work through, while exams were reported to be easier than the homework assignments.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/125529","source_review_id":"UmF0aW5nLTM4MDU0NjUx","instructor_name":"Eric Bach","review_date":"2023-12-30 09:14:04 +0000 UTC","review_id":"4eaae4b779ea49f6fc339319","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:125529"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_2e71825a82859020279c78b8-0.json"]}},{"course_uid":"course_9a1a7bf1933981bcbaca47ac","course_id":"COMPSCI/MATH 240","title":"INTRODUCTION TO DISCRETE MATHEMATICS","credits_min":3,"credits_max":3,"gpa":3.087,"badges":[],"description":"Introduction to Discrete Mathematics covering logic, sets, relations, functions, and discrete structures like integers, strings, trees, and graphs.","discovery":{"term":"1274","offered":true,"history":{"counts":[1286,626,1224,610,350,85,51],"count":4232,"gpa":3.1467391304347827,"topShare":45.17958412098299,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_9a1a7bf1933981bcbaca47ac","uid":"instructor_641f498f8e4956408c5db921","name":"Max Lahn","quality":3.3123422439099737,"quality_count":3,"instructor_url":"/instructors/MAX_LAHN"},{"course_uid":"course_9a1a7bf1933981bcbaca47ac","uid":"instructor_d06a148410e3d6fb6586caea","name":"Isabella Scott","quality":null,"quality_count":0,"instructor_url":"/instructors/ISABELLA_SCOTT"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The course was considered pretty hard due to the sheer amount of content, though the instructor provided fill-in-the-blank lecture notes to save time.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2951377","source_review_id":"UmF0aW5nLTM5NDQ0NzI3","instructor_name":"Luke  Jeffreys","review_date":"2024-05-12 20:32:44 +0000 UTC","review_id":"ea4dfb7df7604f7e357b7e00","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2951377"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_9a1a7bf1933981bcbaca47ac-0.json"]}},{"course_uid":"course_63c43e7ac8225e2773df74d8","course_id":"COMPSCI/MATH/STAT 475","title":"INTRODUCTION TO COMBINATORICS","credits_min":3,"credits_max":3,"gpa":3.101,"badges":[],"description":"Introduction to combinatorics covering enumeration, inclusion-exclusion, generating functions, graph coloring, finite designs, and matching problems with applications in science and puzzles.","discovery":{"term":"1274","offered":true,"history":{"counts":[306,100,186,79,99,25,15],"count":810,"gpa":3.1512345679012346,"topShare":50.123456790123456,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_63c43e7ac8225e2773df74d8","uid":"instructor_3eeb755915088b19ce4d0e3c","name":"Mitch Keller","quality":3.127436344033849,"quality_count":37,"instructor_url":"/instructors/MITCH_KELLER"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The grading system was unique and demanding: students needed full marks on all assignments and tests or extra credit to achieve an A; otherwise, the highest possible grade was an AB.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2872701","source_review_id":"UmF0aW5nLTM4NzQ1MTIx","instructor_name":"Mitch Keller","review_date":"2023-12-19 20:07:49 +0000 UTC","review_id":"4248010302b4c82698f22dbd","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2872701"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2872701","source_review_id":"UmF0aW5nLTQzMDA0NTcy","instructor_name":"Mitch Keller","review_date":"2026-05-02 18:20:43 +0000 UTC","review_id":"627bd9a3f4c7d35ab2ec06f2","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2872701"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_63c43e7ac8225e2773df74d8-0.json"]}},{"course_uid":"course_f237678d9fac59631b4aa4ff","course_id":"COMPSCI/MATH 514","title":"NUMERICAL ANALYSIS","credits_min":3,"credits_max":3,"gpa":3.109,"badges":[{"id":"grade-outcomes","tag":"higher-grades","label":"Higher grades","tone":"positive","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.77 GPA across 42 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_MATH_514#grades"}]}],"description":"Advanced numerical analysis covering polynomial interpolation, approximation, differentiation, integration, splines, and ODE solvers.","discovery":{"term":"1274","offered":true,"history":{"counts":[127,56,51,29,33,12,6],"count":314,"gpa":3.2085987261146496,"topShare":58.28025477707006,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_f237678d9fac59631b4aa4ff","uid":"instructor_e9dd6e6897f68e46e794e28a","name":"Thu Le","quality":3.1577915797417795,"quality_count":19,"instructor_url":"/instructors/THU_LE"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"One student found the homework tedious but manageable, while another noted a heavy workload that was doable with time. Rycroft's exams were challenging but included partial credit, whereas Ohm's exams were described as having very reasonable difficulty.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2868294","source_review_id":"UmF0aW5nLTM3OTQ3Njk5","instructor_name":"Chris Rycroft","review_date":"2023-05-17 20:57:10 +0000 UTC","review_id":"bdbac56f84a062e6b2519725","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2868294"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2924874","source_review_id":"UmF0aW5nLTQxOTY1MDMz","instructor_name":"Laurel Ohm","review_date":"2025-11-28 21:16:35 +0000 UTC","review_id":"ff02df78eef0fc139fd00bbd","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2924874"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_f237678d9fac59631b4aa4ff-0.json"]}},{"course_uid":"course_dd8d2094feb4657373e2e2f3","course_id":"COMPSCI/ECE/ISYE 524","title":"INTRODUCTION TO OPTIMIZATION","credits_min":3,"credits_max":3,"gpa":3.323,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.22 GPA across 101 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_ECE_ISYE_524#grades"}]}],"description":"Introduction to Optimization covers mathematical optimization from a modeling and solution perspective, focusing on formulating discrete and continuous optimization problems and equilibrium models.","discovery":{"term":"1274","offered":true,"history":{"counts":[302,234,158,105,71,22,12],"count":904,"gpa":3.2383849557522124,"topShare":59.29203539823009,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_dd8d2094feb4657373e2e2f3","uid":"instructor_a3665fafb54cf67394b31d12","name":"Jeremy Coulson","quality":null,"quality_count":0,"instructor_url":"/instructors/JEREMY_COULSON"},{"course_uid":"course_dd8d2094feb4657373e2e2f3","uid":"instructor_abb31512ce9d75fc87daa428","name":"Jiawei Zhang","quality":null,"quality_count":0,"instructor_url":"/instructors/JIAWEI_ZHANG"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Homework assignments were difficult and time-consuming, with one student noting they would ruin their social life, while another found them helpful for learning.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/926803","source_review_id":"UmF0aW5nLTM2NzQ5Njk5","instructor_name":"Michael Ferris","review_date":"2022-10-28 18:25:00 +0000 UTC","review_id":"7900bb79cef50ebba0368602","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:926803"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2227000","source_review_id":"UmF0aW5nLTMwMTgxMTYy","instructor_name":"Laurent Lessard","review_date":"2018-05-24 00:52:53 +0000 UTC","review_id":"dc78b5f06be2f43aeca400ea","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2227000"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_dd8d2094feb4657373e2e2f3-0.json"]}},{"course_uid":"course_583cd0f265d9f29704ca13ea","course_id":"COMPSCI 400","title":"PROGRAMMING III","credits_min":3,"credits_max":3,"gpa":3.319,"badges":[],"description":"Programming III is the third course in the programming fundamentals sequence, covering data structures, algorithms, and complexity analysis with an emphasis on professional code quality.","discovery":{"term":"1274","offered":true,"history":{"counts":[1748,1224,1477,434,164,148,65],"count":5260,"gpa":3.282889733840304,"topShare":56.50190114068441,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_583cd0f265d9f29704ca13ea","uid":"instructor_3c20f585497c036ee0ded500","name":"Shayne Wadle","quality":3.54228112892605,"quality_count":8,"instructor_url":"/instructors/SHAYNE_WADLE"},{"course_uid":"course_583cd0f265d9f29704ca13ea","uid":"instructor_84c317fdbc932162addaf020","name":"Florian Heimerl","quality":3.259503995805692,"quality_count":73,"instructor_url":"/instructors/FLORIAN_HEIMERL"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Project workloads varied significantly, ranging from one to over twenty hours per week depending on group dynamics. Exams were generally not considered super difficult, though some students noted that tests covered obscure topics mentioned only briefly in lecture.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2776309","source_review_id":"UmF0aW5nLTM3NTg5NDAy","instructor_name":"Florian Heimerl","review_date":"2023-04-06 08:11:50 +0000 UTC","review_id":"a6aba3726b2ef804c9862e5a","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2776309"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2776309","source_review_id":"UmF0aW5nLTQyMTIzNDkz","instructor_name":"Florian Heimerl","review_date":"2025-12-09 18:54:06 +0000 UTC","review_id":"4d9bf6e4e84cfd87aa576a32","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2776309"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_583cd0f265d9f29704ca13ea-0.json"]}},{"course_uid":"course_883e87fcd87d80e877bb98ab","course_id":"COMPSCI/ECE 352","title":"DIGITAL SYSTEM FUNDAMENTALS","credits_min":3,"credits_max":3,"gpa":3.1,"badges":[],"description":"Covers logic components, Boolean algebra, combinational and sequential logic design, digital subsystems, and computer organization.","discovery":{"term":"1274","offered":true,"history":{"counts":[364,335,252,149,59,10,7],"count":1176,"gpa":3.3035714285714284,"topShare":59.43877551020408,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_883e87fcd87d80e877bb98ab","uid":"instructor_eb1bb94171f8f5bd7e26165f","name":"Setareh Behroozi","quality":3.7730645268321563,"quality_count":40,"instructor_url":"/instructors/SETAREH_BEHROOZI"},{"course_uid":"course_883e87fcd87d80e877bb98ab","uid":"instructor_b9402e06a7d816746041099a","name":"Julie Hsiao","quality":null,"quality_count":0,"instructor_url":"/instructors/JULIE_HSIAO"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Homework assignments were challenging and time-consuming, requiring significant effort. Students found the class became much easier when they actively collaborated with their group and attended discussion sessions.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2827328","source_review_id":"UmF0aW5nLTQwMDIwNTcz","instructor_name":"Setareh Behroozi","review_date":"2024-11-23 20:47:38 +0000 UTC","review_id":"7928178fc1fe58d4ec843b7a","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2827328"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2827328","source_review_id":"UmF0aW5nLTQwMDI1MTAx","instructor_name":"Setareh Behroozi","review_date":"2024-11-25 00:45:52 +0000 UTC","review_id":"7e60e34df3872f3a22c040af","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2827328"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_883e87fcd87d80e877bb98ab-0.json"]}},{"course_uid":"course_28c3390ba944d49fd17f7c72","course_id":"COMPSCI 300","title":"PROGRAMMING II","credits_min":3,"credits_max":3,"gpa":3.286,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.17 GPA across 478 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_300#grades"}]}],"description":"Programming II covers Object-Oriented Programming, introducing array-based and linked data structures like lists, stacks, and queues to solve complex problems.","discovery":{"term":"1274","offered":true,"history":{"counts":[1975,1520,1422,388,198,155,73],"count":5731,"gpa":3.3165241668120746,"topShare":60.98412144477403,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_28c3390ba944d49fd17f7c72","uid":"instructor_dd8b7e35a154a11fc5559910","name":"Jim Williams","quality":3.0576221234853107,"quality_count":155,"instructor_url":"/instructors/JIM_WILLIAMS"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Students reported a large amount of busy work, some of which was challenging and time-consuming. Exams were inconsistent in difficulty, with multiple-choice and programming components varying in ease.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2195385","source_review_id":"UmF0aW5nLTQyMzk2Nzgx","instructor_name":"Jim Williams","review_date":"2025-12-25 15:35:32 +0000 UTC","review_id":"e37b7288e9c0691343561ff0","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2195385"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2195385","source_review_id":"UmF0aW5nLTQxNzIyMDA4","instructor_name":"Jim Williams","review_date":"2025-10-16 02:56:39 +0000 UTC","review_id":"f423d39decb8321bcd95ea96","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2195385"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_28c3390ba944d49fd17f7c72-0.json"]}},{"course_uid":"course_79e5479d9eb1286e8642b399","course_id":"COMPSCI 537","title":"INTRODUCTION TO OPERATING SYSTEMS","credits_min":4,"credits_max":4,"gpa":3.35,"badges":[],"description":"Introduction to Operating Systems covering I/O hardware, interrupts, storage properties, memory management, scheduling, and system evaluation.","discovery":{"term":"1274","offered":true,"history":{"counts":[981,781,450,185,156,35,34],"count":2622,"gpa":3.362700228832952,"topShare":67.20061022120518,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_79e5479d9eb1286e8642b399","uid":"instructor_07391ce1ed4eeb7510f7caab","name":"James Sorenson","quality":null,"quality_count":0,"instructor_url":"/instructors/JAMES_SORENSON"},{"course_uid":"course_79e5479d9eb1286e8642b399","uid":"instructor_5e8dbece5ed04a0d182f9b84","name":"Sara McAllister","quality":null,"quality_count":0,"instructor_url":"/instructors/SARA_MCALLISTER"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The projects took a significant amount of time, and the exams were described as pretty difficult.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2965334","source_review_id":"UmF0aW5nLTQyNjcxNzE2","instructor_name":"Louis Oliphant","review_date":"2026-03-05 23:54:41 +0000 UTC","review_id":"d816fdc15dbf29f34079b3b1","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2965334"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_79e5479d9eb1286e8642b399-0.json"]}},{"course_uid":"course_013300c17c3a4f3c90089d51","course_id":"COMPSCI/ECE/ME 539","title":"INTRODUCTION TO ARTIFICIAL NEURAL NETWORKS","credits_min":3,"credits_max":3,"gpa":3.334,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.23 GPA across 35 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_ECE_ME_539#grades"}]}],"description":"Introduction to Artificial Neural Networks covering theory and applications including MLPs, CNNs, RNNs, SVMs, and genetic algorithms for control, pattern recognition, and object detection.","discovery":{"term":"1274","offered":true,"history":{"counts":[170,221,138,58,12,3,4],"count":606,"gpa":3.3655115511551155,"topShare":64.52145214521452,"firstTerm":"1232","lastTerm":"1264"},"instructors":[],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The course had a huge workload with many homeworks, exercises, and a group project. The first half was very difficult without a strong background in Linear Algebra or Calc 3.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2879084","source_review_id":"UmF0aW5nLTM4ODAyNTY3","instructor_name":"Pedro Morgado","review_date":"2023-12-28 03:26:52 +0000 UTC","review_id":"3bc7cf7ee5b8ea262d70cc0a","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2879084"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2879084","source_review_id":"UmF0aW5nLTQxMDg5NTIy","instructor_name":"Pedro Morgado","review_date":"2025-04-29 19:55:13 +0000 UTC","review_id":"b6a0c1c684553b41842da548","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2879084"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_013300c17c3a4f3c90089d51-0.json"]}},{"course_uid":"course_834bc468ca49d8090d0f211f","course_id":"COMPSCI 220","title":"DATA SCIENCE PROGRAMMING I","credits_min":4,"credits_max":4,"gpa":3.424,"badges":[],"description":"Introduction to Data Science programming using Python with no prior experience required, emphasizing analysis of real datasets and visual communication.","discovery":{"term":"1274","offered":true,"history":{"counts":[2158,2242,1742,326,157,108,82],"count":6815,"gpa":3.366397652237711,"topShare":64.56346294937637,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_834bc468ca49d8090d0f211f","uid":"instructor_841d653f575490f61a7aec9b","name":"Blerina Gkotse","quality":3.702415618835568,"quality_count":23,"instructor_url":"/instructors/BLERINA_GKOTSE"},{"course_uid":"course_834bc468ca49d8090d0f211f","uid":"instructor_97805752d14314b7d669169c","name":"Michael Doescher","quality":3.512879556054398,"quality_count":89,"instructor_url":"/instructors/MICHAEL_DOESCHER"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Projects were extremely time-consuming and often repetitive, but students appreciated that the grade was largely based on their completion rather than just exams.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2593156","source_review_id":"UmF0aW5nLTQyNTAxNzYx","instructor_name":"Michael Doescher","review_date":"2026-01-15 05:38:55 +0000 UTC","review_id":"06ab2e0536c046b50ba857de","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2593156"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_834bc468ca49d8090d0f211f-0.json"]}},{"course_uid":"course_9eb7166a49d161bca95d729f","course_id":"COMPSCI/ECE 252","title":"INTRODUCTION TO COMPUTER ENGINEERING","credits_min":3,"credits_max":3,"gpa":3.296,"badges":[],"description":"Introduction to Computer Engineering covering transistor-based logic, Boolean algebra, combinational and sequential logic design, computer organization, and introductory assembly programming.","discovery":{"term":"1274","offered":true,"history":{"counts":[2593,999,791,381,445,112,66],"count":5387,"gpa":3.377761277148691,"topShare":66.67904213848152,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_9eb7166a49d161bca95d729f","uid":"instructor_eb1bb94171f8f5bd7e26165f","name":"Setareh Behroozi","quality":3.7730645268321563,"quality_count":40,"instructor_url":"/instructors/SETAREH_BEHROOZI"},{"course_uid":"course_9eb7166a49d161bca95d729f","uid":"instructor_3c20f585497c036ee0ded500","name":"Shayne Wadle","quality":3.54228112892605,"quality_count":8,"instructor_url":"/instructors/SHAYNE_WADLE"},{"course_uid":"course_9eb7166a49d161bca95d729f","uid":"instructor_570635b99c1c1cbcfe9e05e1","name":"Swamit Tannu","quality":3.0798428617930615,"quality_count":19,"instructor_url":"/instructors/SWAMIT_TANNU"},{"course_uid":"course_9eb7166a49d161bca95d729f","uid":"instructor_9bc294ac46d9dd3618506aa9","name":"Hezi Zhang","quality":null,"quality_count":0,"instructor_url":"/instructors/HEZI_ZHANG"},{"course_uid":"course_9eb7166a49d161bca95d729f","uid":"instructor_b9402e06a7d816746041099a","name":"Julie Hsiao","quality":null,"quality_count":0,"instructor_url":"/instructors/JULIE_HSIAO"},{"course_uid":"course_9eb7166a49d161bca95d729f","uid":"instructor_6b538cd1085236661960506e","name":"Tsung-Wei Huang","quality":null,"quality_count":0,"instructor_url":"/instructors/TSUNG-WEI_HUANG"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Students noted that homework was the primary basis for learning and was very similar to exams. Some found the homework difficult even with lectures, requiring significant independent work outside of class.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/3156510","source_review_id":"UmF0aW5nLTQzMDExNjE0","instructor_name":"Shayne Wadle","review_date":"2026-05-03 21:22:11 +0000 UTC","review_id":"9af6621f08c3899567e17f01","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:3156510"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/3156510","source_review_id":"UmF0aW5nLTQyNTE1ODIx","instructor_name":"Shayne Wadle","review_date":"2026-01-18 05:41:27 +0000 UTC","review_id":"5e2c901554eb200c85b9206b","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:3156510"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_9eb7166a49d161bca95d729f-0.json"]}},{"course_uid":"course_d68ae7a2fa68407d62f2519f","course_id":"COMPSCI 564","title":"DATABASE MANAGEMENT SYSTEMS: DESIGN AND IMPLEMENTATION","credits_min":4,"credits_max":4,"gpa":3.319,"badges":[],"description":"Covers DBMS design and implementation, including data models, file organization, query processing, concurrency control, recovery, and hands-on experience with relational and network-based systems.","discovery":{"term":"1274","offered":true,"history":{"counts":[973,518,364,236,136,32,11],"count":2270,"gpa":3.3881057268722468,"topShare":65.68281938325991,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_d68ae7a2fa68407d62f2519f","uid":"instructor_4eda1e96fff30f4b53843dc0","name":"Tianyu Li","quality":null,"quality_count":0,"instructor_url":"/instructors/TIANYU_LI"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Exams were reported as very tough and lengthy for the available time, while projects were considered fine.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/3162988","source_review_id":"UmF0aW5nLTQzMDAwMTY3","instructor_name":"Ahmed Mahmood","review_date":"2026-05-01 23:33:06 +0000 UTC","review_id":"055634d6c007e40fb0f58740","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:3162988"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_d68ae7a2fa68407d62f2519f-0.json"]}},{"course_uid":"course_4c46b17e9b3f9a4f2ed9a0e9","course_id":"COMPSCI 544","title":"INTRODUCTION TO BIG DATA SYSTEMS","credits_min":3,"credits_max":3,"gpa":3.398,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.25 GPA across 353 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_544#grades"}]}],"description":"Introduction to Big Data Systems covers deploying distributed systems for storing and analyzing large datasets using unstructured and structured storage, query languages, streaming data, and machine learning in Python.","discovery":{"term":"1274","offered":true,"history":{"counts":[1013,466,501,250,58,20,31],"count":2339,"gpa":3.39760581445062,"topShare":63.232150491663106,"firstTerm":"1242","lastTerm":"1264"},"instructors":[],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Assessment included two 30-minute quizzes and a long project requiring 15-20 hours for a small grade percentage.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2950714","source_review_id":"UmF0aW5nLTQxNzkwODcz","instructor_name":"Tyler Caraza-harter","review_date":"2025-11-03 05:08:28 +0000 UTC","review_id":"97b131e1e309480a5353e30a","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2950714"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_4c46b17e9b3f9a4f2ed9a0e9-0.json"]}},{"course_uid":"course_93d2f66aee95b30379263c4f","course_id":"COMPSCI 559","title":"COMPUTER GRAPHICS","credits_min":3,"credits_max":3,"gpa":3.29,"badges":[{"id":"grade-outcomes","tag":"lower-grades","label":"Lower grades","tone":"negative","evidence":"Spring 2026 · latest released grades before Spring 2027: 3.23 GPA across 83 letter grades, versus 3.50 for Computer Sciences (48 courses). Requires a difference of at least 0.20 and 30 letter grades. Historical outcomes, not predicted difficulty.","sources":[{"label":"Grade history and sources","href":"/courses/COMPSCI_559#grades"}]}],"description":"A survey of computer graphics covering image representation, geometric modeling in 2D/3D, curves/surfaces, rendering, animation, and visualization.","discovery":{"term":"1274","offered":true,"history":{"counts":[484,227,220,57,32,18,23],"count":1061,"gpa":3.4071630537229027,"topShare":67.01225259189444,"firstTerm":"1232","lastTerm":"1264"},"instructors":[],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The workload is demanding, with students reporting that 30 hours a week is not unusual to do well. Individual projects can require a minimum of 30 to 50 hours to complete, making the material and assignments time-intensive.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1554404","source_review_id":"UmF0aW5nLTIyMzYxNTQ3","instructor_name":"Perry Kivolowitz","review_date":"2013-11-21 00:29:12 +0000 UTC","review_id":"8c2d2ed3c0f943ea60f7a1b8","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1554404"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1554404","source_review_id":"UmF0aW5nLTIyNjU0Njgz","instructor_name":"Perry Kivolowitz","review_date":"2013-12-25 15:08:48 +0000 UTC","review_id":"c92c147a97b2c18772959df7","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1554404"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_93d2f66aee95b30379263c4f-0.json"]}},{"course_uid":"course_b588d52f82ec62f25a4f2ece","course_id":"COMPSCI/ECE/ME 532","title":"MATRIX METHODS IN MACHINE LEARNING","credits_min":3,"credits_max":3,"gpa":3.497,"badges":[],"description":"Matrix Methods in Machine Learning covers linear algebraic foundations including SVD, regression, and regularization applied to classification, clustering, and neural networks.","discovery":{"term":"1274","offered":true,"history":{"counts":[566,291,198,132,47,10,13],"count":1257,"gpa":3.4291964996022277,"topShare":68.17820206841687,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_b588d52f82ec62f25a4f2ece","uid":"instructor_60b4ffcf03acb29a8319dac4","name":"Bernie Lesieutre","quality":null,"quality_count":0,"instructor_url":"/instructors/BERNIE_LESIEUTRE"},{"course_uid":"course_b588d52f82ec62f25a4f2ece","uid":"instructor_e1d5923716e3898909bb847b","name":"Ulugbek Kamilov","quality":null,"quality_count":0,"instructor_url":"/instructors/ULUGBEK_KAMILOV"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Homework assignments were challenging but graded on completion, while summer terms were described as crammed and intense.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/329243","source_review_id":"UmF0aW5nLTM3MjQyNDIw","instructor_name":"Robert Nowak","review_date":"2022-12-25 19:08:50 +0000 UTC","review_id":"db59fb1035cf3fa83e8ee6a5","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:329243"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2610349","source_review_id":"UmF0aW5nLTQxNzA4MjM5","instructor_name":"Eduardo Arvelo","review_date":"2025-10-11 21:07:22 +0000 UTC","review_id":"18503eb138ccd783811ff4bc","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2610349"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_b588d52f82ec62f25a4f2ece-0.json"]}},{"course_uid":"course_639b02029dbf953b9704cd63","course_id":"COMPSCI/ISYE/MATH/STAT 726","title":"NONLINEAR OPTIMIZATION I","credits_min":3,"credits_max":3,"gpa":3.408,"badges":[],"description":"Nonlinear Optimization I covers theory and algorithms for nonlinear optimization, focusing on unconstrained optimization techniques.","discovery":{"term":"1274","offered":true,"history":{"counts":[67,81,40,10,2,0,3],"count":203,"gpa":3.4507389162561575,"topShare":72.9064039408867,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_639b02029dbf953b9704cd63","uid":"instructor_307c5a1e319a93016cfbb8d3","name":"Yudong Chen","quality":3.6606031134751915,"quality_count":3,"instructor_url":"/instructors/YUDONG_CHEN"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Assignments often required more than 14 hours to complete, with no penalty-free late days or assignment drops available.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/926803","source_review_id":"UmF0aW5nLTM2MzU2NjMz","instructor_name":"Michael Ferris","review_date":"2022-05-17 06:14:49 +0000 UTC","review_id":"35377442699b530f4724abb7","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:926803"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_639b02029dbf953b9704cd63-0.json"]}},{"course_uid":"course_9b1d5f832c492d1c4a3ce19c","course_id":"COMPSCI 200","title":"PROGRAMMING I","credits_min":3,"credits_max":3,"gpa":3.252,"badges":[],"description":"Programming I introduces fundamental CS concepts through incremental development of small programs. It covers problem abstraction, flow control, functions, and I/O, targeting students with no prior programming experience.","discovery":{"term":"1274","offered":true,"history":{"counts":[1994,724,584,206,161,75,58],"count":3802,"gpa":3.4650184113624407,"topShare":71.48869016307206,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_9b1d5f832c492d1c4a3ce19c","uid":"instructor_84e32ce6cb2c21e7efa7f91d","name":"Andrew Kuemmel","quality":3.7832037206839644,"quality_count":53,"instructor_url":"/instructors/ANDREW_KUEMMEL"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Homework was due Monday through Thursday, often involving participation tasks that took significant time. Students also faced weekly Friday quizzes, with midterms scheduled on Sundays.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1780137","source_review_id":"UmF0aW5nLTQwNDExMDg5","instructor_name":"Andrew Kuemmel","review_date":"2024-12-21 23:03:04 +0000 UTC","review_id":"83063c5db921e36dd185c4dc","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1780137"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1780137","source_review_id":"UmF0aW5nLTQyMTI4MzA3","instructor_name":"Andrew Kuemmel","review_date":"2025-12-09 21:21:35 +0000 UTC","review_id":"c47a953dd74838ab86dbb42c","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1780137"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_9b1d5f832c492d1c4a3ce19c-0.json"]}},{"course_uid":"course_8db0bb2cfe30dfb4e729578a","course_id":"COMPSCI 571","title":"BUILDING USER INTERFACES","credits_min":3,"credits_max":3,"gpa":3.468,"badges":[],"description":"Introduction to software development of user interfaces, covering UI paradigms, diverse user input handling, and platform-specific APIs for web, mobile, desktop, and voice interfaces.","discovery":{"term":"1274","offered":true,"history":{"counts":[803,713,379,115,53,21,8],"count":2092,"gpa":3.4698852772466537,"topShare":72.46653919694073,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_8db0bb2cfe30dfb4e729578a","uid":"instructor_66359daabf07f9f841e2a2f8","name":"Cole Nelson","quality":null,"quality_count":0,"instructor_url":"/instructors/COLE_NELSON"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The workload was high but useful, with extensions and extra credit provided to help manage the intensity.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2754330","source_review_id":"UmF0aW5nLTM1NTk2MjM2","instructor_name":"Yuhang Zhao","review_date":"2021-12-19 10:05:52 +0000 UTC","review_id":"7fead21943e1735e88218d4b","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2754330"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_8db0bb2cfe30dfb4e729578a-0.json"]}},{"course_uid":"course_e0f984e8747ee9ccaba16d75","course_id":"COMPSCI 540","title":"INTRODUCTION TO ARTIFICIAL INTELLIGENCE","credits_min":3,"credits_max":3,"gpa":3.308,"badges":[],"description":"Introduction to Artificial Intelligence covering search, deduction, knowledge representation, machine learning, and probabilistic reasoning with applications in NLP, vision, and robotics.","discovery":{"term":"1274","offered":true,"history":{"counts":[1595,1165,861,187,81,19,21],"count":3929,"gpa":3.4840926444387885,"topShare":70.24688215831,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_e0f984e8747ee9ccaba16d75","uid":"instructor_ec1878010c68dc0e47f34349","name":"Young Wu","quality":2.9115275236754323,"quality_count":48,"instructor_url":"/instructors/YOUNG_WU"},{"course_uid":"course_e0f984e8747ee9ccaba16d75","uid":"instructor_b8b55ebb322997b52025ef8f","name":"Misha Khodak","quality":null,"quality_count":0,"instructor_url":"/instructors/MISHA_KHODAK"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Exams were reported as extremely difficult, with one student stating they were impossible to prepare for using class materials alone. Another described the exams as 'sadistic' but noted the instructor was helpful when students reached out.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2510986","source_review_id":"UmF0aW5nLTQwMjE5NjU3","instructor_name":"Young Wu","review_date":"2024-12-11 14:25:47 +0000 UTC","review_id":"173762a6cc7d2cda642d3e4b","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2510986"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2510986","source_review_id":"UmF0aW5nLTQwMzgyMzcx","instructor_name":"Young Wu","review_date":"2024-12-19 17:06:18 +0000 UTC","review_id":"caf84737397825a5d59e4a28","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2510986"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_e0f984e8747ee9ccaba16d75-0.json"]}},{"course_uid":"course_ab7d07685857737322064a42","course_id":"COMPSCI 640","title":"INTRODUCTION TO COMPUTER NETWORKS","credits_min":3,"credits_max":3,"gpa":3.38,"badges":[],"description":"Introduction to Computer Networks covers architecture, protocols, layering, routing, security, and performance using Ethernet, IP, TCP, and HTTP.","discovery":{"term":"1274","offered":true,"history":{"counts":[348,218,153,56,31,0,2],"count":808,"gpa":3.485148514851485,"topShare":70.04950495049505,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_ab7d07685857737322064a42","uid":"instructor_3ac838c6afee48372d59d98f","name":"Ming Liu","quality":3.8073548643971757,"quality_count":5,"instructor_url":"/instructors/MING_LIU"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The course typically includes four moderate quizzes and four straightforward programs, though one student warned that the final program was particularly challenging.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1820723","source_review_id":"UmF0aW5nLTMwMDgzNjg0","instructor_name":"Suman Banerjee","review_date":"2018-05-12 14:32:37 +0000 UTC","review_id":"181790d77813fbed6aa8d20e","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1820723"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_ab7d07685857737322064a42-0.json"]}},{"course_uid":"course_45a9d9a05cba4d5b592ac7a3","course_id":"COMPSCI/ECE 552","title":"INTRODUCTION TO COMPUTER ARCHITECTURE","credits_min":3,"credits_max":3,"gpa":3.336,"badges":[],"description":"Introduction to Computer Architecture covers processor design, instruction sets, control structures, memory management, caches, and I/O structures.","discovery":{"term":"1274","offered":true,"history":{"counts":[334,187,87,57,22,7,5],"count":699,"gpa":3.4978540772532187,"topShare":74.53505007153076,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_45a9d9a05cba4d5b592ac7a3","uid":"instructor_eb1bb94171f8f5bd7e26165f","name":"Setareh Behroozi","quality":3.7730645268321563,"quality_count":40,"instructor_url":"/instructors/SETAREH_BEHROOZI"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The course was described as extremely hard, particularly for undergraduates, with one student noting it made their brain hurt. TAs and the professor went the extra mile to break down difficult concepts.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2827328","source_review_id":"UmF0aW5nLTM5MjcwMTY3","instructor_name":"Setareh Behroozi","review_date":"2024-04-25 21:24:19 +0000 UTC","review_id":"853c371ed8a69c4bae8aacdc","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2827328"},{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/2827328","source_review_id":"UmF0aW5nLTM5NDAxOTM2","instructor_name":"Setareh Behroozi","review_date":"2024-05-08 03:46:11 +0000 UTC","review_id":"236f572f162dfc7f19ca253e","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:2827328"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_45a9d9a05cba4d5b592ac7a3-0.json"]}},{"course_uid":"course_6205df2080c6f734c520ff84","course_id":"COMPSCI 542","title":"INTRODUCTION TO SOFTWARE SECURITY","credits_min":3,"credits_max":3,"gpa":3.504,"badges":[],"description":"Introduction to Software Security covers secure design, secure programming, vulnerability assessment, static/dynamic analysis tools, and system defenses across the SDLC.","discovery":{"term":"1274","offered":true,"history":{"counts":[251,67,78,24,24,7,2],"count":453,"gpa":3.5044150110375276,"topShare":70.19867549668875,"firstTerm":"1232","lastTerm":"1264"},"instructors":[{"course_uid":"course_6205df2080c6f734c520ff84","uid":"instructor_48a2696f59d60ab65f218be4","name":"Barton Miller","quality":2.789892484384726,"quality_count":37,"instructor_url":"/instructors/BARTON_MILLER"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"The class required weekly quizzes, a participation event, and extra credit opportunities. One student noted that while the course was less challenging than core CS classes, missing quizzes made getting an A difficult.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1174681","source_review_id":"UmF0aW5nLTM4ODE5NDUz","instructor_name":"Barton Miller","review_date":"2024-01-02 08:51:55 +0000 UTC","review_id":"82ddf935ae31bcf3c4f29c78","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1174681"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_6205df2080c6f734c520ff84-0.json"]}},{"course_uid":"course_7eeaacff8f7faf3b2b412ad2","course_id":"COMPSCI/LIS 472","title":"INTRODUCTION TO WEB DEVELOPMENT","credits_min":3,"credits_max":3,"gpa":3.537,"badges":[],"description":"Introduction to Web Development covers secure/interactive web content, programming fundamentals, CMSs, accessibility, design, ethics, and website implementation using scripting languages and frameworks.","discovery":{"term":"1274","offered":true,"history":{"counts":[77,36,22,8,3,1,2],"count":149,"gpa":3.5369127516778525,"topShare":75.83892617449665,"firstTerm":"1254","lastTerm":"1264"},"instructors":[],"instructorHistory":null,"courseComparison":null,"claim":null,"reviewFiles":[]}},{"course_uid":"course_280431e0039b9a9194e1b074","course_id":"COMPSCI 557","title":"PARALLEL & THROUGHPUT- OPTIMIZED PROGRAMMING","credits_min":3,"credits_max":3,"gpa":3.543,"badges":[],"description":"Introduction to high-performance computing focusing on shared-memory systems, multithreaded programming, vectorization, and memory hierarchy using numerical algorithms as case studies.","discovery":{"term":"1274","offered":true,"history":{"counts":[60,47,21,7,2,0,1],"count":138,"gpa":3.5434782608695654,"topShare":77.53623188405797,"firstTerm":"1254","lastTerm":"1264"},"instructors":[{"course_uid":"course_280431e0039b9a9194e1b074","uid":"instructor_2acc6a2db605729bd4d444c2","name":"Eftychios Sifakis","quality":3.6194440768070084,"quality_count":27,"instructor_url":"/instructors/EFTYCHIOS_SIFAKIS"}],"instructorHistory":null,"courseComparison":null,"claim":{"text":"Lectures primarily involved case study go-throughs with code. Practice exams were provided for review, supporting the course's lenient grading structure.","evidence_scope":"past_student_reviews","citations":[{"type":"review","source_url":"https://www.ratemyprofessors.com/professor/1727820","source_review_id":"UmF0aW5nLTQyODkxNzUw","instructor_name":"Eftychios Sifakis","review_date":"2026-04-21 20:34:15 +0000 UTC","review_id":"49226b50a7c050857a4d0322","run_id":"20261014T203208-0851c9a1","source_instructor_id":"rmp:1727820"}]},"reviewFiles":["/data/fc1811fa52e581ea57a35c0cf3343f8740a8ffbf/reviews/course_280431e0039b9a9194e1b074-0.json"]}}]}}}