Historical grades cover up to five years through the selected term. Grade sorting prioritizes courses with at least 100 letter grades.
Introduction to Computer Engineering covers logic components, Boolean algebra, logic design, computer organization, and assembly-language programming.
Offering recorded · Fall 2026
Sinclair enforces strict deadlines and requires diligent self-study. Wadle’s lectures are criticized as unhelpful or confusing, requiring heavy independent work.
historical GPA · grades
Spring 2022–Spring 2026Covers digital system fundamentals including logic components, Boolean algebra, and computer organization design.
Offering recorded · Fall 2026
Homework is challenging and time-consuming, but attending discussion sessions and collaborating with groups makes the class much easier to manage.
historical GPA · grades
Spring 2022–Spring 2026COMPSCI/ECE 354 introduces computer system structures and C programming, covering memory, assembly, and compilation.
Offering recorded · Fall 2026
Projects are lengthy and require early starts, while bi-weekly quizzes and dense course materials add to the workload and preparation demands.
historical GPA · grades
Spring 2022–Spring 2026Software Engineering teaches techniques for designing, developing, and modifying large software systems, covering processes, architecture, and team management.
Offering recorded · Fall 2026
The course focuses on agile team software projects and is considered easy if students participate, though logistics and reading quizzes add to the workload.
historical GPA · grades
Fall 2022–Spring 2026COMPSCI/ECE 533 covers the mathematical representation of images, including degradation models, enhancement, restoration, segmentation, coding, pattern recognition, and tomography.
Offering recorded · Fall 2026
Historical reviews indicate high difficulty, citing assignment errors and unclear problem explanations in class.
historical GPA · grades
Fall 2022–Fall 2025Introduction to computer architecture covering processor, memory, and I/O system design.
Offering recorded · Fall 2026
Historical reviews of Matthew Sinclair, Mikko Lipasti, Parmesh Ramanathan: Reviewers characterize the workload as intense, citing long group projects, dense online lectures, and difficult exams that require significant outside effort and preparation.
historical GPA · grades
Spring 2022–Spring 2026Advanced Computer Architecture I covers processor design, pipelining, cache memories, and instruction set design.
Offering recorded · Fall 2026
Reviewers describe the class as having a heavy workload with significant reading and difficult exams, though one notes the instructor curves grades to historical averages.
historical GPA · grades
Spring 2022–Fall 2025COMPSCI/ECE 760 covers computational approaches to learning, including inductive inference, explanation-based learning, and cognitive modeling.
Offering recorded · Fall 2026
One reviewer rated the difficulty as 5/5 and noted that students were expected to read PowerPoint slides to prepare for class.
historical GPA · grades
Spring 2022–Spring 2026Covers hardware and software solutions for advanced computing in engineering, with hands-on parallel programming assignments.
Offering recorded · Fall 2026
Historical reviews of Dan Negrut: Reviewers note the class involves significant work, particularly weekly programming assignments, but consider them doable with effort.
historical GPA · grades
Fall 2022–Spring 2026Introduction to mathematical optimization, covering formulation of discrete and continuous problems and equilibrium models, and usage of algorithms and software tools.
Offering recorded · Fall 2026
The course is extremely difficult with long, challenging homework assignments that can take up to 20 hours, requiring substantial independent study time.
historical GPA · grades
Spring 2022–Spring 2026Introduction to the technical aspects of cryptography and secure digital information transmission.
Offering recorded · Fall 2026
The course includes five graded homeworks, two midterms, and a final. While some find exams manageable with lecture notes, others report they are unexpectedly difficult or narrowly focused.
historical GPA · grades
Spring 2022–Spring 2026MATRIX METHODS IN MACHINE LEARNING covers linear algebraic foundations and matrix methods for machine learning applications like classification, clustering, and data analysis.
Offering recorded · Fall 2026
Reviewers describe the workload as excessive, with heavy weekly homework and four exams. The course is considered difficult, featuring hard proofs and exams that are hard to finish.
historical GPA · grades
Spring 2022–Spring 2026Introduction to artificial neural networks and their applications in control, pattern recognition, and prediction.
Offering recorded · Fall 2026
Historical reviews of Kangwook Lee, Pedro Morgado, Yu Hen Hu: The course is consistently described as difficult with a heavy workload, including extensive homework, group projects, and dense theoretical content requiring strong math backgrounds.
historical GPA · grades
Spring 2022–Spring 2026Covers HCI principles, research methods, data analysis, and a semester-long research project in critical domains.
Offering recorded · Fall 2026
historical GPA · grades
Fall 2022–Fall 2025Covers dynamic programming techniques and applications to problems like shortest-path, TSP, and Markovian decision processes.
Offering recorded · Fall 2026
historical GPA · grades
Fall 2023–Fall 2025 · limited sampleStudy of convex sets, functions, and duality with applications to operations research.
Offering recorded · Fall 2026
historical GPA · grades
Spring 2025–Spring 2025 · limited sampleIntroduction to combinatorial optimization covering exact and approximation algorithms for discrete structures.
Offering recorded · Fall 2026
Reviewers describe the workload as heavy, with time-consuming homework and brutal exams. The course requires deep knowledge of in-depth proofs, making it challenging for non-elite math majors.
historical GPA · grades
Fall 2023–Fall 2025Introduces linear optimization problems, emphasizing formal proofs, the simplex method, duality theory, and theorems of the alternatives.
Offering recorded · Fall 2026
The course is considered very difficult, with hard assignments that require significant study time, though group work is permitted. Exams are reported as easier than homework, although one student found the final exam unexpectedly difficult despite its stated format.
historical GPA · grades
Spring 2022–Spring 2026Covers theory and algorithms for nonlinear optimization, focusing on unconstrained methods like quasi-Newton and trust-region techniques.
Offering recorded · Fall 2026
Assignments are graded harshly, and the course is notoriously difficult, requiring significant preparation to keep up with the rigorous material.
historical GPA · grades
Spring 2022–Spring 2026Introduction to Computing provides a broad overview of computing topics like security, robotics, and AI, and algorithmic problem solving.
Offering recorded · Fall 2026
The workload involves daily in-person attendance and completing assignments posted after lectures, often requiring students to bring fully charged computers. Some reviewers note that outside work can be long and that the Canvas page is disorganized.
historical GPA · grades
Fall 2023–Spring 2026USER EXPERIENCE DESIGN 1 introduces the user experience design process, ethics, methods, and tools, including formative research and design proposals.
Offering recorded · Fall 2026
historical GPA · grades
Fall 2022–Fall 2025Undergraduate Cooperative Education providing full-time work experience that combines classroom theory with practical knowledge in Computer Sciences, Data Science, Statistics, or Information Science.
Offering recorded · Fall 2026
historical GPA · grades
Fall 2025–Fall 2025 · limited sampleIntroduction to discrete mathematics covering logic, proofs, sets, functions, and discrete structures like graphs and trees.
Offering recorded · Fall 2026
Reviewers describe the course as difficult, citing tough exams, lengthy proofs, and time-consuming homework as the main challenges.
historical GPA · grades
Spring 2022–Spring 2026Numerical Analysis covers polynomial approximation, interpolation, splines, numerical integration, and methods for solving ordinary differential equations.
Offering recorded · Fall 2026
Reviewers describe the workload as manageable with relative homework, but note a large volume of material and a tough class environment requiring strong math preparation.
historical GPA · grades
Fall 2022–Spring 2026Methods of Computational Mathematics I covers finite difference and volume methods for PDEs, analyzing accuracy and stability, and solving linear systems.
Offering recorded · Fall 2026
One historical review describes the load as not heavy, while others do not specify workload intensity.
historical GPA · grades
Fall 2022–Fall 2025Introduction to combinatorics covering enumeration, generating functions, graph theory, and matching problems.
Offering recorded · Fall 2026
The course is dense and challenging. Homework is feasible but requires reading the textbook, as lectures may not fully explain concepts. Exams often draw directly from the book and previous tests.
historical GPA · grades
Spring 2022–Spring 2026COMPSCI/STAT 403 allows students to earn academic credit for outside internships related to Computer Sciences or Data Science programs.
Offering recorded · Fall 2026
historical GPA · grades
Spring 2022–Spring 2026COUNPSY 110: Career Strategies explores vocational development and the value of work through self-assessment and career planning.
Offering recorded · Fall 2026
historical GPA · grades
Spring 2023–Spring 2026 · limited sampleExplores resources to optimize academic success and persistence through didactic and experiential learning methods.
Offering recorded · Fall 2026
historical GPA · grades
Spring 2022–Spring 2026A first-year seminar exploring resources to optimize academic success, persistence, and belonging through identity analysis.
Offering recorded · Fall 2026
No recorded grade history