COMP Courses

Here is information about COMP class enrollment for summer I 2024. Classes with no meeting time listed are not shown. Feel free to contact me with any questions/comments/issues. I am happy to add any departments that are missing from these listings, just reach out to ask!

Click here to show class descriptions. Click here to hide them.

Data also available for: COMP, AMST, COMM, MATH, STOR

Data last updated: 2024-04-26 14:34:19.520482

Class Number	Class	Meeting Time	Instructor	Room	Unreserved Enrollment	Reserved Enrollment	Total Enrollment	Wait List
2332	COMP 110 - 001 Introduction to Programming and Data Science	MoTuWeThFr 9:45AM - 11:15AM	Alyssa Byrnes	F Brooks - Sitterson - Rm F007	Seats filled	Seats filled	40/40	2/999
Description: Prerequisite, A C or better in one of the following courses: MATH 130, 152, 210, 231, 129P, or PHIL 155, or STOR 120, 151, 155. Introduces students to programming and data science from a computational perspective. With an emphasis on modern applications in society, students gain experience with problem decomposition, algorithms for data analysis, abstraction design, and ethics in computing. No prior programming experience expected. Foundational concepts include data types, sequences, boolean logic, control flow, functions/methods, recursion, classes/objects, input/output, data organization, transformations, and visualizations. Students may not enroll in COMP 110 after receiving credit for COMP 210. 3 units.
1629	COMP 116 - 001 Introduction to Scientific Programming	MoTuWeThFr 11:30AM - 1:00PM	Brent Munsell	Sitterson Hall (inc-Rm SN115	16/25	Seats filled	16/25	0/999
Description: Prerequisite, MATH 231 or 241; a grade of C or better is required. An introduction to programming for computationally oriented scientists. Fundamental programming skills, typically using MATLAB or Python. Problem analysis and algorithm design with examples drawn from simple numerical and discrete problems. 3 units.
2198	COMP 210 - 001 Data Structures and Analysis	MoTuWeThFr 8:00AM - 9:30AM	Kaki Ryan	F Brooks - Sitterson - Rm F007	14/40	Seats filled	14/40	0/999
Description: Prerequisites, COMP 110 and MATH 231; a grade of C or better is required in both prerequisite courses ; Pre- or corequisite, COMP 283 or MATH 381. This course will teach you how to organize the data used in computer programs so that manipulation of that data can be done efficiently on large problems and large data instances. Rather than learning to use the data structures found in the libraries of programming languages, you will be learning how those libraries are constructed, and why the items that are included in them are there (and why some are excluded). 3 units.
1630	COMP 283 - 001 Discrete Structures	MoTuWeThFr 11:30AM - 1:00PM	Md Taksir Hasan Majumder	F Brooks - Sitterson - Rm F007	9/40	Seats filled	9/40	0/999
Description: Prerequisite, MATH 231 or MATH 241; a grade of C or better is required. Introduces discrete structures (sets, tuples, relations, functions, graphs, trees) and the formal mathematics (logic, proof, induction) used to establish their properties and those of algorithms that work with them. Develops problem-solving skills through puzzles and applications central to computer science. 3 units.
2568	COMP 301 - 001 Foundations of Programming	MoTuWeThFr 9:45AM - 11:15AM	Mason Laney	Sitterson Hall (inc-Rm FB009	14/30	Seats filled	14/30	0/999
Description: Prerequisites, COMP 210; COMP 283 or MATH 381; a grade of C or better is required in both prerequisite courses. Students will learn how to reason about how their code is structured, identify whether a given structure is effective in a given context, and look at ways of organizing units of code that support larger programs. In a nutshell, the primary goal of the course is to equip students with tools and techniques that will help them not only in later courses in the major but also in their careers afterwards. 3 units.
2199	COMP 550 - 001 Algorithms and Analysis	MoTuWeTh 3:00PM - 5:00PM	Kevin Sun	F Brooks - Sitterson - Rm F009	Seats filled	Seats filled	30/30	1/999
Description: Prerequisites, COMP 211 and 301; or COMP 410; a grade of C or better is required in all prerequisite courses. Formal specification and verification of programs. Techniques of algorithm analysis. Problem-solving paradigms. Survey of selected algorithms. 3 units.