CS 498

Spring 2012 All Classes

All Classes

Special Topics

Credit: 0 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.

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 spring 2012
CRN	Type	Section	Time	Day	Location	Instructor	Section Details
43755	Lecture	DM3	12:30PM -1:45PM	TR	1103 Siebel Center for Comp Sci	Marinov, D	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 3 hours Section Title: Software Testing Section Info: Topic: Software Testing. This course will provide an introduction to systematic and organized approaches to software testing. Topics to be covered include testing process, coverage criteria, automatic and manual generation of test inputs, execution of tests, and validation of test outputs. This section is for undergraduate OR graduate students.
48196	Lecture	DM4	12:30PM -1:45PM	TR	1103 Siebel Center for Comp Sci	Marinov, D	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 4 hours Section Title: Software Testing Section Info: Topic: Software Testing. This course will provide an introduction to systematic and organized approaches to software testing. Topics to be covered include testing process, coverage criteria, automatic and manual generation of test inputs, execution of tests, and validation of test outputs. This section is for graduate students only. Restriction(s): Restricted to Graduate - Urbana-Champaign.
56907	Lecture	DP3	10:00AM -10:50AM	MWF	1109 Siebel Center for Comp Sci	Padua, D	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 3 hours Section Title: Intro to Parallel Programming Section Info: Topic: Intro to Parallel Programming for Computer Scientists and Computer Engineers. Parallel programming notations for shared and distributed memory machines, memory models, atomic operations, race conditions, synchronous and asynchronous computations, performance evaluation, parallel algorithms including graph algorithms, sorting, numerical linear algebra, and FFT. This section is for undergraduate or graduate students.
56908	Lecture	DP4	10:00AM -10:50AM	MWF	1109 Siebel Center for Comp Sci	Padua, D	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 4 hours Section Title: Intro to Parallel Programming Section Info: Topic: Intro to Parallel Programming for Computer Scientists and Computer Engineers. Parallel programming notations for shared and distributed memory machines, memory models, atomic operations, race conditions, synchronous and asynchronous computations, performance evaluation, parallel algorithms including graph algorithms, sorting, numerical linear algebra, and FFT. This section is for graduate students only. Restriction(s): Restricted to Graduate - Urbana-Champaign.
56968	Lecture	FU3	12:30PM -1:45PM	WF	1103 Siebel Center for Comp Sci	Fu, W	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 3 hours Section Title: HCI Lab Section Info: Topic: HCI Lab. This is a lab course for the design and implementation of socio-computer interfaces, such as systems that support online communities, social networks, peer production, or collection actions. Students will engage in group projects throughout the course. Students with strong technical background in implementing user interfaces and knowledge in socio-computer interactions are preferred. This section is for undergraduate OR graduate students. Restriction(s): Restricted to students in the Computer Science department.
56969	Lecture	FU4	12:30PM -1:45PM	WF	1103 Siebel Center for Comp Sci	Fu, W	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 4 hours Section Title: HCI Lab Section Info: Topic: HCI Lab. This is a lab course for the design and implementation of socio-computer interfaces, such as systems that support online communities, social networks, peer production, or collection actions. Students will engage in group projects throughout the course. Students with strong technical background in implementing user interfaces and knowledge in socio-computer interactions are preferred. This section is for graduate students only. Restriction(s): Restricted to students in the Computer Science department. Restricted to Graduate - Urbana-Champaign.
57126	Lecture	HP3	9:30AM -10:45AM	WF	1103 Siebel Center for Comp Sci	Har-Peled, S	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 3 hours Section Title: Intro Computational Geometry Section Info: Topic: Introduction to Computational Geometry. Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Important applications of computational geometry include robotics (motion planning and visibility problems), graphics, geographic information systems (GIS) (geometrical location and search, route planning), integrated circuit design (IC geometry design and verification), computer-aided engineering (CAE) (mesh generation). This course would be a gentle introduction to the field, The course would follow the book "Computational Geometry: Algorithms and Applications" by de Berg, Cheong, van Kreveld and Overmars. Prerequisite: CS 473 or equivalent. This section is for either undergraduate or graduate students.
57127	Lecture	HP4	9:30AM -10:45AM	WF	1103 Siebel Center for Comp Sci	Har-Peled, S	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 4 hours Section Title: Intro Computational Geometry Section Info: Topic: Introduction to Computational Geometry. Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Important applications of computational geometry include robotics (motion planning and visibility problems), graphics, geographic information systems (GIS) (geometrical location and search, route planning), integrated circuit design (IC geometry design and verification), computer-aided engineering (CAE) (mesh generation). This course would be a gentle introduction to the field, The course would follow the book "Computational Geometry: Algorithms and Applications" by de Berg, Cheong, van Kreveld and Overmars. Prerequisite: CS 473 or equivalent. This section is for graduate students only. Restriction(s): Restricted to Graduate - Urbana-Champaign.
50445	Lecture-Discussion	LA	ARRANGED	n.a.	ARR Siebel Center for Comp Sci	Angrave, L	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 3 hours Section Title: Undergrad Research Lab Section Info: Topic: Undergraduate Research Laboratory In this apprenticeship-style, hands-on laboratory, students learn to i) Pose testable research questions; ii) Write competitive grant proposals; iii) Create novel solutions using software and/or hardware; iv) Draw valid scientific conclusions; and v) Present and publish results, conclusions and other materials. This team-based course is for undergraduate students only. Restriction(s): Restricted to Undergrad - Urbana-Champaign.
56905	Lecture	MC3	12:30PM -1:45PM	WF	1214 Siebel Center for Comp Sci	Caesar, M	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 3 hours Section Title: Networking Lab Section Info: Topic: Networking Lab. This course teaches an understanding of networks and systems design through hands-on construction and experimentation with real-world implementations. Students will perform bi-weekly projects in building, analyzing, evaluating, and deploying the communication protocols and server software that make up widely used network infrastructures. This course complements introductory computer networking courses such as CS 438 to cover practical and experimental aspects of networking. Prerequisite: CS 241 (Systems Programming), or equivalent course on operating systems or networking. This section is for either undergraduates or graduate students.
56906	Lecture	MC4	12:30PM -1:45PM	WF	1214 Siebel Center for Comp Sci	Caesar, M	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 4 hours Section Title: Networking Lab Section Info: Topic: Networking Lab. This course teaches an understanding of networks and systems design through hands-on construction and experimentation with real-world implementations. Students will perform bi-weekly projects in building, analyzing, evaluating, and deploying the communication protocols and server software that make up widely used network infrastructures. This course complements introductory computer networking courses such as CS 438 to cover practical and experimental aspects of networking. Prerequisite: CS 241 (Systems Programming), or equivalent course on operating systems or networking. This section is for graduate students only. Restriction(s): Restricted to Graduate - Urbana-Champaign.
54566	Lecture	MV3	3:30PM -4:45PM	TR	1131 Siebel Center for Comp Sci	Viswanathan, M	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 3 hours Section Title: Logical Systems Section Info: Topic: Logical Systems. This course will provide an introduction to mathematical logic from the perspective of computer science, emphasizing decidable fragments of logic and decision algorithms. The topics covered will be motivated by applications in artificial intelligence, databases, formal methods and theoretical computer science. The goal of the course is to prepare students for using logic as a formal tool in computer science. The course will roughly cover the following topics (in this order): syntax, semantics and proof theory of propositional logic, sat-solvers, syntax of first-order, the resolution proof system, syntax of second-order logic, connections between monadic second order logic and regular languages (word and tree, finite and infinite), tree-width and Courcelle's theorem with applications to parametric complexity, finite model theory and descriptive complexity, games and inexpressiveness. Prerequisite: Courses CS 173, CS 225, and CS 373, or instructor's consent. In particular, students should be familiar with inductive proofs, propositional logic syntax, ability to use quantifiers (forall and exists) to express simple properties in first-order logic, basic properties of finite graphs, simple graph algorithms, finite automata and regular languages, deterministic and non-deterministic computational models, and complexity classes like NP. This section is for either undergraduate or graduate students.
54567	Lecture	MV4	3:30PM -4:45PM	TR	1131 Siebel Center for Comp Sci	Viswanathan, M	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 4 hours Section Title: Logical Systems Section Info: Topic: Logical Systems. This course will provide an introduction to mathematical logic from the perspective of computer science, emphasizing decidable fragments of logic and decision algorithms. The topics covered will be motivated by applications in artificial intelligence, databases, formal methods and theoretical computer science. The goal of the course is to prepare students for using logic as a formal tool in computer science. The course will roughly cover the following topics (in this order): syntax, semantics and proof theory of propositional logic, sat-solvers, syntax of first-order, the resolution proof system, syntax of second-order logic, connections between monadic second order logic and regular languages (word and tree, finite and infinite), tree-width and Courcelle's theorem with applications to parametric complexity, finite model theory and descriptive complexity, games and inexpressiveness. Prerequisite: Courses CS 173, CS 225, and CS 373, or instructor's consent. In particular, students should be familiar with inductive proofs, propositional logic syntax, ability to use quantifiers (forall and exists) to express simple properties in first-order logic, basic properties of finite graphs, simple graph algorithms, finite automata and regular languages, deterministic and non-deterministic computational models, and complexity classes like NP. This section is for graduate students only. Restriction(s): Restricted to Graduate - Urbana-Champaign.