CS 498

Fall 2024 All Classes

All Classes

Special Topics

SHOW FINAL EXAM SCHEDULE

Credit: 1 TO 4 hours.

Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites.

1 to 4 undergraduate hours. 1 to 4 graduate hours. May be repeated in the same or separate terms if topics vary.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 498 class schedule data for fall 2024
CRN	Type	Section	Time	Day	Location	Instructor	Section Details
54283	Laboratory-Discussion Online	CSP CSP	2:30PM -3:50PM ARRANGED	S n.a.	Location Pending n.a.	Bhowmik, U Bhowmik, U	Part of Term: 1 Date Range: 08/26/24-12/11/24 Credit: 3 hours Section Title: Principles of Safe Autonomy Section Info: This section is intended for Chicago City Scholars only. There may be online and in person components. You are responsible for completing homeworks, quizzes, and any in person activities that are required. Please speak with your professor regarding expectations. Weekly in-person meeting in Classroom A at 200 S. Wacker Dr., Chicago Restriction(s): Restricted to O/C Engineering City Scholars students.
54284	Laboratory-Discussion Online	MC4 MC4	2:30PM -3:50PM ARRANGED	S n.a.	Location Pending n.a.	Bhowmik, U Bhowmik, U	Part of Term: 1 Date Range: 08/26/24-12/11/24 Credit: 4 hours Section Title: Principles of Safe Autonomy Section Info: This section is intended for Chicago MCS only. There may be online and in person components. You are responsible for completing homeworks, quizzes, and any in person activities that are required. Please speak with your professor regarding expectations. Weekly in-person meeting in Classroom A at 200 S. Wacker Dr., Chicago Restriction(s): Restricted to MCS: Computer Sci OFF - UIUC.
49838	Lecture	RC1	2:00PM -3:15PM	TR	124 Burrill Hall	Cunningham, R	Part of Term: 1 Date Range: 08/26/24-12/11/24 Credit: 4 hours Section Title: Law &Policy Issues in CS Section Info: Law and Policy Issues In Computer Science This course will explore the intersection of public policy and computing technology. After a basic overview of the US legal system and administrative state, the course will examine the ways computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students in the course will complete a series of technical projects related to legal issues, including scrutinizing digital rights management technology, evaluating digital forensics reports and expert testimony, and critiquing software patents. Students will also be expected to regularly read and respond to excerpts from relevant legal cases. Topics covered in the course will include Fourth and Fifth Amendment protections in cyberspace, network neutrality, antitrust, Section 230, cryptocurrency and digital property, espionage, and cyberwarfare. Prerequisite: CS 225 For up-to-date information about CS course restrictions, please see the following link: http://go.cs.illinois.edu/csregister Restriction(s): Restricted to Undergrad - Urbana-Champaign. Not intended for First Time Freshman students.
31535	Lecture	RCG	2:00PM -3:15PM	TR	124 Burrill Hall	Cunningham, R	Part of Term: 1 Date Range: 08/26/24-12/11/24 Credit: 4 hours Section Title: Law &Policy Issues in CS Section Info: For up-to-date information about CS course restrictions, please see the following link: http://go.cs.illinois.edu/csregister Law and Policy Issues In Computer Science This course will explore the intersection of public policy and computing technology. After a basic overview of the US legal system and administrative state, the course will examine the ways computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students in the course will complete a series of technical projects related to legal issues, including scrutinizing digital rights management technology, evaluating digital forensics reports and expert testimony, and critiquing software patents. Students will also be expected to regularly read and respond to excerpts from relevant legal cases. Topics covered in the course will include Fourth and Fifth Amendment protections in cyberspace, network neutrality, antitrust, Section 230, cryptocurrency and digital property, espionage, and cyberwarfare. Prerequisite of CS 225. Restriction(s): Restricted to Graduate - Urbana-Champaign. Not intended for First Time Freshman students.
61940	Lecture	RCU	2:00PM -3:15PM	TR	124 Burrill Hall	Cunningham, R	Part of Term: 1 Date Range: 08/26/24-12/11/24 Credit: 3 hours Section Title: Law &Policy Issues in CS Section Info: Law and Policy Issues In Computer Science This course will explore the intersection of public policy and computing technology. After a basic overview of the US legal system and administrative state, the course will examine the ways computing technology is regulated in areas such as privacy, crime, intellectual property, commerce, and national security. Students in the course will complete a series of technical projects related to legal issues, including scrutinizing digital rights management technology, evaluating digital forensics reports and expert testimony, and critiquing software patents. Students will also be expected to regularly read and respond to excerpts from relevant legal cases. Topics covered in the course will include Fourth and Fifth Amendment protections in cyberspace, network neutrality, antitrust, Section 230, cryptocurrency and digital property, espionage, and cyberwarfare. Prerequisite: CS 225 For up-to-date information about CS course restrictions, please see the following link: http://go.cs.illinois.edu/csregister Restriction(s): Restricted to Undergrad - Urbana-Champaign. Not intended for First Time Freshman students.
64852	Lecture	TC3	3:30PM -4:45PM	TR	3101 Sidney Lu Mech Engr Bldg	Chan, T	Part of Term: 1 Date Range: 08/26/24-12/11/24 Credit: 3 hours Section Title: Computational Geometry Section Info: This course provides an introduction to the design and analysis of algorithms for solving geometric problems. Geometric data arise in many application areas. We will study the theoretical complexity of fundamental algorithmic problems in computational geometry, such as convex hulls, Voronoi diagrams/Delaunay triangulations, low-dimensional linear programming, line segment intersection, polygon triangulation, and more. Prerequisite: solid background in algorithms, at the level of CS 374. For up-to-date information about CS course restrictions, please view the following link for restrictions and release dates: http://go.cs.illinois.edu/csregister. Restriction(s): Restricted to Graduate - Urbana-Champaign. Not intended for MCS:Computer Sci Online -UIUC, MCS:Computer Sci Online -UIUC, or NDEG:Computer Science Onl-UIUC. Not intended for First Time Freshman students.
64853	Lecture	TC4	3:30PM -4:45PM	TR	3101 Sidney Lu Mech Engr Bldg	Chan, T	Part of Term: 1 Date Range: 08/26/24-12/11/24 Credit: 4 hours Section Title: Computational Geometry Section Info: This course provides an introduction to the design and analysis of algorithms for solving geometric problems. Geometric data arise in many application areas. We will study the theoretical complexity of fundamental algorithmic problems in computational geometry, such as convex hulls, Voronoi diagrams/Delaunay triangulations, low-dimensional linear programming, line segment intersection, polygon triangulation, and more. Prerequisite: solid background in algorithms, at the level of CS 374. For up-to-date information about CS course restrictions, please view the following link for restrictions and release dates: http://go.cs.illinois.edu/csregister. Restriction(s): Restricted to Graduate - Urbana-Champaign. Not intended for MCS:Computer Sci Online -UIUC, MCS:Computer Sci Online -UIUC, or NDEG:Computer Science Onl-UIUC. Not intended for First Time Freshman students.
64847	Lecture	TCU	3:30PM -4:45PM	TR	3101 Sidney Lu Mech Engr Bldg	Chan, T	Part of Term: 1 Date Range: 08/26/24-12/11/24 Credit: 3 hours Section Title: Computational Geometry Section Info: This course provides an introduction to the design and analysis of algorithms for solving geometric problems. Geometric data arise in many application areas. We will study the theoretical complexity of fundamental algorithmic problems in computational geometry, such as convex hulls, Voronoi diagrams/Delaunay triangulations, low-dimensional linear programming, line segment intersection, polygon triangulation, and more. Prerequisite: solid background in algorithms, at the level of CS 374. For up-to-date information about CS course restrictions, please view the following link for restrictions and release dates: http://go.cs.illinois.edu/csregister. Restriction(s): Restricted to Undergrad - Urbana-Champaign.