CS 491

Spring 2019 All Classes

All Classes

Seminar

SHOW FINAL EXAM SCHEDULE

Credit: 0 TO 4 hours.

Seminar on topics of current interest as announced in the Class Schedule.

0 to 4 undergraduate hours. 0 to 4 graduate hours. Approved for S/U grading only. May be repeated in the same or separate terms if topics vary to a maximum of 4 hours. Prerequisite: As specified for each topic offering, see Class Schedule or departmental course description.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 491 class schedule data for spring 2019
	CRN	Type	Section	Time	Day	Location	Instructor	Section Details
	54144	Lecture	CB	5:00PM -5:50PM	R	Location Pending	Bashir, M Campbell, R	Part of Term: 1 Date Range: 01/14/19-05/01/19 Credit: 2 hours Section Title: IAT Seminar Section Info: Course meets in 301 CSL Topic: Information Assurance and Trust Seminar. This course is an undergraduate seminar for students admitted to the Illinois Cyber Security Scholar Program. In addition, this course would be open and serve as an orientation seminar to all college of engineering undergraduate student interested in topics of information assurance and trust. The seminars will feature information assurance subject matter expert guest speakers from industry and government, community leaders, distinguished external researchers, faculty, and students discussing both the technical challenges and limitations of IA. Standard information assurance topics such as authentication, data integrity, ethics, and cyber security will be covered.
	64481	Laboratory	WF	1:00PM -1:50PM	M	Siebel Center for Comp Sci	Beckman, M Marinov, D	Part of Term: 1 Date Range: 01/14/19-05/01/19 Credit: 1 hours Section Title: Adv Competitive Algorithm Prog Section Info: This course introduces advanced algorithms and data structures concepts useful for competing effectively in the ACM International Collegiate Programming Contest (ICPC) World Finals and similar contests. This course assumes familiarity with and proficiency in solving intermediate-difficulty algorithmic programming problems using dynamic programming, graph algorithms, mathematics, computational geometry, combinatorial games, and standard library data structures. This course is recommended for students hoping to learn how to solve difficult problems that appear in the ACM ICPC World Finals contest and later stages of multi-stage programming contests. The course requires completion of short problem sets and participation in practice contests.