Spring Term Schedule
Spring 2023
Number  Title  Instructor  Time 

CSC 1611
Andrew ReadMcFarland
TR 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. This course is for nonmajors, and/or students with less math and science background. Lab and workshop required. This course may not be used for CSC major credit if completed after or at the same time as CSC171


CSC 16110
Andrew ReadMcFarland
M 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16111
Andrew ReadMcFarland
M 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16112
Andrew ReadMcFarland
T 3:25PM  4:40PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16113
Andrew ReadMcFarland
T 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16114
Andrew ReadMcFarland
T 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16115
Andrew ReadMcFarland
W 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16116
Andrew ReadMcFarland
W 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16117
Andrew ReadMcFarland
W 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16118
Andrew ReadMcFarland
W 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16119
Andrew ReadMcFarland
W 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1612
Andrew ReadMcFarland
TR 2:00PM  3:15PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16120
Andrew ReadMcFarland
W 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16121
Andrew ReadMcFarland
R 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16122
Andrew ReadMcFarland
R 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1613
Andrew ReadMcFarland
MW 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1614
Andrew ReadMcFarland
MW 3:25PM  4:40PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1615
Andrew ReadMcFarland
TR 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1616
Andrew ReadMcFarland
M 2:00PM  3:15PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1617
Andrew ReadMcFarland
M 3:25PM  4:40PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1618
Andrew ReadMcFarland
M 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1619
Andrew ReadMcFarland
M 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1701
Andrew ReadMcFarland
TR 11:05AM  12:20PM


An introduction to the World Wide Web and related technologies. Topics include HTML5 and CSS3, Progressive Enhancement, and Web page design. Emphasis is placed on fundamentals, industry standards and best practices. Additional topics include: web site construction techniques, mobile design issues, and Search Engine Optimization (SEO). Programming with JavaScript will be introduced.


CSC 1702
Andrew ReadMcFarland
MW 9:00AM  10:15AM


An introduction to the World Wide Web and related technologies. Topics include HTML5 and CSS3, Progressive Enhancement, and Web page design. Emphasis is placed on fundamentals, industry standards and best practices. Additional topics include: web site construction techniques, mobile design issues, and Search Engine Optimization (SEO). Programming with JavaScript will be introduced.


CSC 1703
Andrew ReadMcFarland
MW 12:30PM  1:45PM


An introduction to the World Wide Web and related technologies. Topics include HTML5 and CSS3, Progressive Enhancement, and Web page design. Emphasis is placed on fundamentals, industry standards and best practices. Additional topics include: web site construction techniques, mobile design issues, and Search Engine Optimization (SEO). Programming with JavaScript will be introduced.


CSC 1711
Adam Purtee
TR 2:00PM  3:15PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC & DSCC majors.


CSC 17110
Adam Purtee
M 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17111
Adam Purtee
M 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17112
Adam Purtee
M 7:40PM  8:55PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17113
Adam Purtee
T 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17114
Adam Purtee
T 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17115
Adam Purtee
T 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17116
Adam Purtee
T 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17118
Adam Purtee
T 7:40PM  8:55PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17119
Adam Purtee
W 3:25PM  4:40PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1712
Adam Purtee
MW 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17120
Adam Purtee
W 3:25PM  4:40PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17121
Adam Purtee
W 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17122
Adam Purtee
R 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1713
Adam Purtee
MW 12:30PM  1:45PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1714
Adam Purtee
MW 10:25AM  11:40AM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1715
Adam Purtee
MW 2:00PM  3:15PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1718
Adam Purtee
M 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1719
Adam Purtee
M 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1721
Eustrat Zhupa
TR 3:25PM  4:40PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required. Prerequisites: CSC 171 or equivalent, MATH 150. May be taken concurrently with MATH 150 if CSC 171 prerequisite is satisfied.


CSC 17210
Eustrat Zhupa
M 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17211
Eustrat Zhupa
M 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17212
Eustrat Zhupa
M 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17213
Eustrat Zhupa
T 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17214
Eustrat Zhupa
T 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17215
Eustrat Zhupa
T 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17216
Eustrat Zhupa
T 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17217
Eustrat Zhupa
W 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17218
Eustrat Zhupa
W 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17219
Eustrat Zhupa
W 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1722
Eustrat Zhupa
TR 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17220
Eustrat Zhupa
W 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17221
Eustrat Zhupa
W 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17222
Eustrat Zhupa
R 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17223
Eustrat Zhupa
R 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1723
Eustrat Zhupa
MW 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1724
Eustrat Zhupa
MW 2:00PM  3:15PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1725
Eustrat Zhupa
MW 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1726
Eustrat Zhupa
MW 3:25PM  4:40PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1727
Eustrat Zhupa
M 3:25PM  4:40PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1728
Eustrat Zhupa
M 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1729
Eustrat Zhupa
M 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1731
George Ferguson
TR 2:00PM  3:15PM


An introduction to some of the most important formal models of computation, and their application to realworld computing problems. Prerequisites: CSC 172 and MTH 150. AUDITS NOT ALLOWED.


CSC 1861
Thaddeus Pawlicki
TR 11:05AM  12:20PM


This course is a handson lab based introduction to software engineering and computer programming using the development of computer/video games as the application area. Topics will include mesh modeling, level design, asset management, shading, texturing, lighting, event scripting, character rigging, and particle effects.


CSC 2001
Fatemeh Nargesian
MW 4:50PM  6:05PM


Intensive seminar on cooperative problem solving. Overview of the subdisciplines and the research of the University of Rochester’s computer science faculty. Instruction and practice on research methodology and procedures. The topic may vary from year to year. Students taking CSC 200H may have additional reading, assignments or projects. 200H is required for the Honors B.S. in Computer Science. Students who participate or intend to participate in research are well advised to take CSC 200/200H.


CSC 200H1
Fatemeh Nargesian
MW 4:50PM  6:05PM


Intensive seminar on cooperative problem solving. Overview of the subdisciplines and the research of the University of Rochester’s computer science faculty. Instruction and practice on research methodology and procedures. The topic may vary from year to year. taking CSC 200H may have additional reading, assignments or projects. Students who participate or intend to participate in research are well advised to take CSC 200/200H. 200H is required for the Honors B.S. in Computer Science. CSC 200H students propose and complete a final project in cooperative problem solving in an area of computer science research. They are required to attend computer science department colloquiums when their schedule permits.


CSC 2101
Andrew ReadMcFarland
TR 3:25PM  4:40PM


The World Wide Web was born around 1990, so it is not much older than most of you. In this course, we will follow the growth of the Web from its toddler years, to early childhood, to its turbulent preteen and teenage years, and finally as it begins to mature as a young adult. Along this journey, you will learn influential Web technologies such as HTTP, HTML, JavaScript, CSS, the LAMP stack, XML, JSON, Ajax, WebSockets, and modern MVC frameworks. Even though you will be doing a lot of programming in this course, its purpose is not to teach you to become an expert in any particular language or framework. Web technologies change at a blistering pace, so specifics quickly get outdated. However, once you take this course and understand the fundamentals, you will be able to easily pick up new technologies on the fly. Prerequisites: CSC 172. *No audits will be allowed for this course


CSC 2111
Zhen Bai
TR 12:30PM  1:45PM


The goal of this course is to provide an introductory overview of the concepts, principles, methods and special topics of HumanComputer Interaction (HCI). This course will help students to build a frame of reference of HCI approaches and apply them in conducting design practices for realworld problems. This course contains a combination of lectures, seminars and group projects. The lectures will cover origins of HCI and interaction design, usercentered design methods, usability evaluation and user experience. The seminars will be a combination of guest lecturers and studentled discussions to introduce special topics in HCI, which may include Augmented and Virtual Reality, Tangible User Interface, HumanRobot Interaction, learning technologies, and assistive technologies. The group project will take place throughout the course and provide an opportunity for students to apply and reflect on HCI methods and usercentered design processes through contextual inquiry, prototyping, evaluation, iteration and presentation. Prerequisite: CSC 172 (required), CSC 214 (desired), or permission of the instructor.


CSC 2141
Arthur Roolfs
TR 6:15PM  7:30PM


Coursework covers user interface designs and functional algorithms for mobile devices (iOS summer/fall, Android spring) and unique user interactions using multitouch technologies. Objectoriented design including modelviewcontroller paradigm, memory management. Other topics include: objectoriented database API, animation, web services and performance considerations. Prerequisites: CSC 172


CSC 2401
Thaddeus Pawlicki
TR 4:50PM  6:05PM


Fundamental concepts and techniques of data mining, including data attributes, data visualization, data preprocessing, mining frequent patterns, association and correlation, classification methods, and cluster analysis. Advanced topics include outlier detection, stream mining, and social media data mining. CSC 440, a graduatelevel course, requires additional readings and a course project. Prerequisites will be strictly enforced: CSC171, CSC 172 and MTH 161. Recommended: CSC 242 or CSC262; MTH165.


CSC 2421
George Ferguson
TR 9:40AM  10:55AM


Introduces fundamental principles and techniques from Artificial Intelligence, including heuristic search, automated reasoning, handling uncertainty, and machine learning, to prepare students for advanced AI courses. Prerequisites: CSC 172 and MTH 150; CSC 173 STRONGLY Recommended. AUDITS NOT ALLOWED.


CSC 2431
Ralf Haefner
MW 3:25PM  4:40PM


This is a seminarstyle course for advanced undergraduate and graduate students covering multiple areas of computational neuroscience by weekly readings and student presentations. Many of the topics are deeper explorations of topics covered in CSC 241 Introduction to Computational Neuroscience, focusing on the sensory system, decisionmaking, action selection and active inference, especially from a probabilistic and normative perspective. The reading list is somewhat flexible and adaptable to student interest. There is an opportunity for a final project but this is not required. Prerequisite: CSC 241 or permission of instructor


CSC 2461
Adam Purtee
TR 11:05AM  12:20PM


Mathematical foundations of classification, regression, and decision making. Supervised algorithms covered include perceptrons, logistic regression, support vector machines, and neural networks. Directed and undirected graphical models. Numerical parameter optimization, including gradient descent, expectation maximization, and other methods. Introduction to reinforcement learning. Proofs covered as appropriate. Significant programming projects will be assigned. This course involves a lot of math and algorithms. You should know multivariable calculus, linear algebra, and some algorithms. No formal prerequisites but MATH 165, MATH 164, and CSC 242 strongly recommended.


CSC 2471
Hangfeng He
MW 3:25PM  4:40PM


This course addresses issues of representing computing meaning from natural language, especially issues of understanding language in context using commonsense knowledge of the world. Topics will include a survey of English phrase structure and parsing, semantic representation (e.g., events, semantic roles, time, causality and speech acts), and theories and techniques for understanding language in context, including intention recognition, text understanding using knowledge of scripts and plans, and models of spoken dialogue systems (e.g., conversational agents such as Siri). CSC447, the graduate level version of the course, requires a substantial individual project. Prerequisite: CSC 242


CSC 2491
Jiebo Luo
TR 9:40AM  10:55AM


Introduction to computer vision, including camera models, basic image processing, pattern and object recognition, and elements of human vision. Specific topics include geometric issues, statistical models, Hough transforms, color theory, texture, and optic flow. CSC 449, a graduatelevel course, requires additional readings and assignments. Prerequisites: MATH 161 and CSC 242; MATH 165 strongly recommended


CSC 2501
Scott Grimm
TR 11:05AM  12:20PM


This course addresses linguistic research questions through data science techniques. The course will focus on developing skills to (i) acquire and process a variety of language data, from using established corpora to capturing data in the wild, and (ii) to investigate language use, particularly syntactic and semantic phenomena, through descriptive and inferential statistical techniques. A significant part of the course will be devoted to handson projects and will include developing familiarity with using the programming languages Python and R to acquire and explore linguistic data. Familiarity with statistics and/or computational linguistics is advantageous, but not necessary. Prerequisites: LING 110, and either LING 210, LING 220 or LING 225.


CSC 2521
Yuhao Zhu
WF 3:25PM  4:40PM


Introduction to computer architecture and the layering of hardware/software systems. Topics include instruction set design; logical building blocks; computer arithmetic; processor organization; the memory hierarchy (registers, caches, main memory, and secondary storage); I/Obuses, devices, and interrupts; microcode and assembly language; virtual machines; the roles of the assembler, linker, compiler, and operating system; technological trends and the future of computing hardware. Several programming assignments required. Prerequisites: MTH 150 and CSC 172


CSC 2551
Sreepathi Pai
MW 10:25AM  11:40AM


Programming is the automation of information processing. Program analysis and transformation is the automation of programming itselfhow much a program can understand and improve other programs. Because of the diversity and complexity of computer hardware, programmers increasingly depend on automation in compilers and other tools to deliver efficient and reliable software. This course combines fundamental principles and (handson) practical applications. Specific topics include data flow and dependence theories; static and dynamic program transformation including parallelization; memory and cache management; type checking and program verification; and performance analysis and modeling. The knowledge and practice will help students to become experts in software performance and correctness. Students taking the graduate level will have additional course requirements and a more difficult project. Recommended prerequisites: CSC 252, CSC 254.


CSC 2581
Chen Ding
MW 3:25PM  4:40PM


Principles of parallel and distributed systems, and the associated implementation and performance issues. Topics covered will include programming interfaces to parallel and distributed computing, interprocess communication, synchronization, and consistency models, fault tolerance and reliability, distributed process management, distributed file systems, multiprocessor architectures, parallel program optimization, and parallelizing compilers. Students taking this course at the 400 level will be required to complete additional readings and/or assignments. Prerequisites: CSC 252 and (CSC 254 or CSC 256) or instructor permission


CSC 2601
Ehsan Hoque
W 2:00PM  4:40PM


We currently add 51 billion tons of greenhouse gases to the atmosphere every year. We need to get it down to zero to stop the warming and avoid a cloud disaster. How? In this class, we will discuss and explore the role of technology to bring innovative breakthroughs to combat this unique challenge. Examples include the use of machine learning techniques to better predict climate, visualizing the effects of extreme weather to create awareness, monitoring the emission of carbon with satellite imagery. The lectures will consist of discussions, reading papers, guest lecturers, and a final project. Prerequisite: CSC 242.


CSC 2611
Eustrat Zhupa
MW 3:25PM  4:40PM


This course presents the fundamental concepts of database design and use. It provides a study of data models, data description languages, and query facilities including relational algebra and SQL, data normalization, transactions and their properties, physical data organization and indexing, security issues and object databases. It also looks at the new trends in databases. The knowledge of the above topics will be applied in the design and implementation of a database application using a target database management system as part of a semesterlong group project. Prerequisites: CSC 172; CSC 173 and CSC 252 recommended.


CSC 2631
Fatemeh Nargesian
MW 9:00AM  10:15AM


This course explores the internals of data engines. Topics covered will include the relational model; relational database design principles based on dependencies and normal forms; query execution; transactions; recovery; query optimization; parallel query processing; NoSQL. Restricted to CSC and DSCC majors only during initial registration period. Prerequisites:CSC 173 and CSC 252 (or CSC 261)


CSC 2661
Christopher Kanan
MW 10:25AM  11:40AM


Deep learning has revolutionized many areas of artificial intelligence, including computer vision, natural language understanding, and more. This course reviews some of the latest advancements in deep learning, with a focus on methods that overcome the need for vast amounts of labeled data. Topics covered may include, but are not limited to, selfsupervised learning in vision and language, selftraining methods (e.g., studentteacher networks), continual learning, foundation models (e.g., Stable Diffusion, GPT3, CLIP, etc), learning from biased and longtailed datasets, and theory topics related to generalization in deep learning (e.g., The Lottery Ticket Hypothesis, Deep Double Descent, etc.). There are no formal requirements, but students are expected to know linear algebra, multivariate calculus, and have basic knowledge of deep learning, e.g, loss functions, optimization, regularization, multilayer perceptron neural network architectures, etc.


CSC 273W1
Joseph Loporcaro
T 4:50PM  6:05PM


In this course, students prepare, critique, and discuss written materials relevant to Computer Science. Will count as one of the two upper level writing requirements for Computer Science majors. If the course is closed, DO NOT email the professor.


CSC 273W2
Joseph Loporcaro
R 2:00PM  3:15PM


In this course, students prepare, critique, and discuss written materials relevant to Computer Science. Will count as one of the two upper level writing requirements for Computer Science majors. If the course is closed, DO NOT email the professor.


CSC 2781
John Criswell
MW 6:15PM  7:30PM


This course will teach students the foundations of computer security. Students will learn what security is, the design principles of secure systems, how security is enforced, and how security is compromised. Topics include access controls, information flow, basic applications of cryptography, buffer overflow attacks, and malware. Prerequisites: CSC 252 or CSC 452 or ECE 200.


CSC 2801
Lane Hemaspaandra
MW 3:25PM  4:40PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites include CSC 173 and MATH 150. YOU MUST REGISTER FOR A RECITATION WHEN REGISTERING FOR THE MAIN COURSE


CSC 28011
Lane Hemaspaandra
W 4:50PM  6:05PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability.


CSC 2802
Lane Hemaspaandra
W 4:50PM  6:05PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites are CSC 173 and MTH 150.


CSC 2803
Lane Hemaspaandra
W 6:15PM  7:30PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites include CSC 173 and MTH 150.


CSC 2804
Lane Hemaspaandra
R 4:50PM  6:05PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites include CSC 173 and MTH 150


CSC 2805
Lane Hemaspaandra
R 6:15PM  7:30PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites include CSC 173 and MTH 150.


CSC 2807
Lane Hemaspaandra
W 6:15PM  7:30PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites are CSC 173 and MTH 150.


CSC 2808
Lane Hemaspaandra
R 7:40PM  8:55PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites are CSC 173 and MTH 150.


CSC 2809
Lane Hemaspaandra
R 3:25PM  4:40PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites are CSC 173 and MTH 150


CSC 2821
Eustrat Zhupa
TR 9:40AM  10:55AM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments. Prerequisites: (CSC 172 and MATH 150) or MATH172. Students MUST register for the recitation when registering for this course.


CSC 2822
Eustrat Zhupa
T 6:15PM  7:30PM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.


CSC 2823
Eustrat Zhupa
W 6:15PM  7:30PM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.


CSC 2824
Eustrat Zhupa
M 6:15PM  7:30PM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.


CSC 2825
Eustrat Zhupa
W 7:40PM  8:55PM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.


CSC 2861
Lane Hemaspaandra
MW 2:00PM  3:15PM


The difference between computable and uncomputable problems and between feasible and infeasible problems. Regarding the latter, what properties of a problem make it computationally simple? What properties of a problem may preclude its having efficient algorithms? How computationally hard are problems? Complete sets and low information content; P=NP?; unambiguous computation and oneway functions; reductions relating the complexity of problems; complexity classes and hierarchies. Prerequisite: CSC 280


CSC 2891
Anson Kahng
MW 4:50PM  6:05PM


This class will provide an introduction to topics at the intersection of computer science and economics, including game theory, auctions, incentivecompatible mechanism design, matching algorithms, human computation (e.g., crowdsourcing and peer prediction), trust and reputation systems, and social choice (voting) theory. We hope to convey the fact that the relationship between computer science and economics is a twoway street: It is important to consider incentives and strategic action are important when designing computationintensive systems, and efficient and robust algorithms enable the deployment of impactful economic ideas. Prerequisites: Familiarity with probability theory, singlevariable calculus, linear algebra, and basics of theoretical computer science. No background in economic theory is assumed or required. Students should also be prepared to write code in Python. Please email the instructor with any questions.


CSC 2951
Thaddeus Pawlicki
TR 12:30PM  1:45PM


This course covers special topics that are of current interest in the area of Quantum Computing. Topics vary by term.


CSC 2991
Joseph Loporcaro
MW 3:25PM  4:40PM


Computers and the Internet, perhaps more than any other technology, have transformed society over the past 50 years. In developed nations, at least, they have enabled dramatic increases in human productivity; an explosion of options for news, entertainment, and communication; and fundamental breakthroughs in almost every branch of science and engineering. At the same time, they have contributed to unprecedented threats to privacy; whole new categories of crime and antisocial behavior; major disruptions in the job market; and the largescale concentration of risk into systems capable of catastrophic failure. In this discussion and writingoriented class, we will consider all of this and more, with the goal of better understanding how to shape technological change in ways that maximize the benefits and minimize the costs.


CSC 299W1
Joseph Loporcaro
MW 3:25PM  4:40PM


Computers and the Internet, perhaps more than any other technology, have transformed society over the past 50 years. In developed nations, at least, they have enabled dramatic increases in human productivity; an explosion of options for news, entertainment, and communication; and fundamental breakthroughs in almost every branch of science and engineering. At the same time, they have contributed to unprecedented threats to privacy; whole new categories of crime and antisocial behavior; major disruptions in the job market; and the largescale concentration of risk into systems capable of catastrophic failure. In this discussion and writingoriented class, we will consider all of this and more, with the goal of better understanding how to shape technological change in ways that maximize the benefits and minimize the costs. This course will be asynchronous. CSC299 can be taken as a ULW or not.


CSC 3902
Arthur Roolfs
–


Blank Description


CSC 3904
Fatemeh Nargesian
–


Blank Description


CSC 3921
–
–


Registration for Independent Study courses needs to be completed thru the instructions for online independent study registration.

Spring 2023
Number  Title  Instructor  Time 

Monday  
CSC 1616
Andrew ReadMcFarland
M 2:00PM  3:15PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1617
Andrew ReadMcFarland
M 3:25PM  4:40PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1727
Eustrat Zhupa
M 3:25PM  4:40PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1618
Andrew ReadMcFarland
M 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1619
Andrew ReadMcFarland
M 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1718
Adam Purtee
M 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1719
Adam Purtee
M 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1728
Eustrat Zhupa
M 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1729
Eustrat Zhupa
M 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 16110
Andrew ReadMcFarland
M 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16111
Andrew ReadMcFarland
M 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 17110
Adam Purtee
M 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17111
Adam Purtee
M 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17210
Eustrat Zhupa
M 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2824
Eustrat Zhupa
M 6:15PM  7:30PM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.


CSC 17112
Adam Purtee
M 7:40PM  8:55PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17211
Eustrat Zhupa
M 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17212
Eustrat Zhupa
M 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


Monday and Wednesday  
CSC 1702
Andrew ReadMcFarland
MW 9:00AM  10:15AM


An introduction to the World Wide Web and related technologies. Topics include HTML5 and CSS3, Progressive Enhancement, and Web page design. Emphasis is placed on fundamentals, industry standards and best practices. Additional topics include: web site construction techniques, mobile design issues, and Search Engine Optimization (SEO). Programming with JavaScript will be introduced.


CSC 2631
Fatemeh Nargesian
MW 9:00AM  10:15AM


This course explores the internals of data engines. Topics covered will include the relational model; relational database design principles based on dependencies and normal forms; query execution; transactions; recovery; query optimization; parallel query processing; NoSQL. Restricted to CSC and DSCC majors only during initial registration period. Prerequisites:CSC 173 and CSC 252 (or CSC 261)


CSC 1714
Adam Purtee
MW 10:25AM  11:40AM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 2551
Sreepathi Pai
MW 10:25AM  11:40AM


Programming is the automation of information processing. Program analysis and transformation is the automation of programming itselfhow much a program can understand and improve other programs. Because of the diversity and complexity of computer hardware, programmers increasingly depend on automation in compilers and other tools to deliver efficient and reliable software. This course combines fundamental principles and (handson) practical applications. Specific topics include data flow and dependence theories; static and dynamic program transformation including parallelization; memory and cache management; type checking and program verification; and performance analysis and modeling. The knowledge and practice will help students to become experts in software performance and correctness. Students taking the graduate level will have additional course requirements and a more difficult project. Recommended prerequisites: CSC 252, CSC 254.


CSC 2661
Christopher Kanan
MW 10:25AM  11:40AM


Deep learning has revolutionized many areas of artificial intelligence, including computer vision, natural language understanding, and more. This course reviews some of the latest advancements in deep learning, with a focus on methods that overcome the need for vast amounts of labeled data. Topics covered may include, but are not limited to, selfsupervised learning in vision and language, selftraining methods (e.g., studentteacher networks), continual learning, foundation models (e.g., Stable Diffusion, GPT3, CLIP, etc), learning from biased and longtailed datasets, and theory topics related to generalization in deep learning (e.g., The Lottery Ticket Hypothesis, Deep Double Descent, etc.). There are no formal requirements, but students are expected to know linear algebra, multivariate calculus, and have basic knowledge of deep learning, e.g, loss functions, optimization, regularization, multilayer perceptron neural network architectures, etc.


CSC 1703
Andrew ReadMcFarland
MW 12:30PM  1:45PM


An introduction to the World Wide Web and related technologies. Topics include HTML5 and CSS3, Progressive Enhancement, and Web page design. Emphasis is placed on fundamentals, industry standards and best practices. Additional topics include: web site construction techniques, mobile design issues, and Search Engine Optimization (SEO). Programming with JavaScript will be introduced.


CSC 1713
Adam Purtee
MW 12:30PM  1:45PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1715
Adam Purtee
MW 2:00PM  3:15PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 1724
Eustrat Zhupa
MW 2:00PM  3:15PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2861
Lane Hemaspaandra
MW 2:00PM  3:15PM


The difference between computable and uncomputable problems and between feasible and infeasible problems. Regarding the latter, what properties of a problem make it computationally simple? What properties of a problem may preclude its having efficient algorithms? How computationally hard are problems? Complete sets and low information content; P=NP?; unambiguous computation and oneway functions; reductions relating the complexity of problems; complexity classes and hierarchies. Prerequisite: CSC 280


CSC 1614
Andrew ReadMcFarland
MW 3:25PM  4:40PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1726
Eustrat Zhupa
MW 3:25PM  4:40PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2431
Ralf Haefner
MW 3:25PM  4:40PM


This is a seminarstyle course for advanced undergraduate and graduate students covering multiple areas of computational neuroscience by weekly readings and student presentations. Many of the topics are deeper explorations of topics covered in CSC 241 Introduction to Computational Neuroscience, focusing on the sensory system, decisionmaking, action selection and active inference, especially from a probabilistic and normative perspective. The reading list is somewhat flexible and adaptable to student interest. There is an opportunity for a final project but this is not required. Prerequisite: CSC 241 or permission of instructor


CSC 2471
Hangfeng He
MW 3:25PM  4:40PM


This course addresses issues of representing computing meaning from natural language, especially issues of understanding language in context using commonsense knowledge of the world. Topics will include a survey of English phrase structure and parsing, semantic representation (e.g., events, semantic roles, time, causality and speech acts), and theories and techniques for understanding language in context, including intention recognition, text understanding using knowledge of scripts and plans, and models of spoken dialogue systems (e.g., conversational agents such as Siri). CSC447, the graduate level version of the course, requires a substantial individual project. Prerequisite: CSC 242


CSC 2581
Chen Ding
MW 3:25PM  4:40PM


Principles of parallel and distributed systems, and the associated implementation and performance issues. Topics covered will include programming interfaces to parallel and distributed computing, interprocess communication, synchronization, and consistency models, fault tolerance and reliability, distributed process management, distributed file systems, multiprocessor architectures, parallel program optimization, and parallelizing compilers. Students taking this course at the 400 level will be required to complete additional readings and/or assignments. Prerequisites: CSC 252 and (CSC 254 or CSC 256) or instructor permission


CSC 2611
Eustrat Zhupa
MW 3:25PM  4:40PM


This course presents the fundamental concepts of database design and use. It provides a study of data models, data description languages, and query facilities including relational algebra and SQL, data normalization, transactions and their properties, physical data organization and indexing, security issues and object databases. It also looks at the new trends in databases. The knowledge of the above topics will be applied in the design and implementation of a database application using a target database management system as part of a semesterlong group project. Prerequisites: CSC 172; CSC 173 and CSC 252 recommended.


CSC 2801
Lane Hemaspaandra
MW 3:25PM  4:40PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites include CSC 173 and MATH 150. YOU MUST REGISTER FOR A RECITATION WHEN REGISTERING FOR THE MAIN COURSE


CSC 2991
Joseph Loporcaro
MW 3:25PM  4:40PM


Computers and the Internet, perhaps more than any other technology, have transformed society over the past 50 years. In developed nations, at least, they have enabled dramatic increases in human productivity; an explosion of options for news, entertainment, and communication; and fundamental breakthroughs in almost every branch of science and engineering. At the same time, they have contributed to unprecedented threats to privacy; whole new categories of crime and antisocial behavior; major disruptions in the job market; and the largescale concentration of risk into systems capable of catastrophic failure. In this discussion and writingoriented class, we will consider all of this and more, with the goal of better understanding how to shape technological change in ways that maximize the benefits and minimize the costs.


CSC 299W1
Joseph Loporcaro
MW 3:25PM  4:40PM


Computers and the Internet, perhaps more than any other technology, have transformed society over the past 50 years. In developed nations, at least, they have enabled dramatic increases in human productivity; an explosion of options for news, entertainment, and communication; and fundamental breakthroughs in almost every branch of science and engineering. At the same time, they have contributed to unprecedented threats to privacy; whole new categories of crime and antisocial behavior; major disruptions in the job market; and the largescale concentration of risk into systems capable of catastrophic failure. In this discussion and writingoriented class, we will consider all of this and more, with the goal of better understanding how to shape technological change in ways that maximize the benefits and minimize the costs. This course will be asynchronous. CSC299 can be taken as a ULW or not.


CSC 1712
Adam Purtee
MW 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 2001
Fatemeh Nargesian
MW 4:50PM  6:05PM


Intensive seminar on cooperative problem solving. Overview of the subdisciplines and the research of the University of Rochester’s computer science faculty. Instruction and practice on research methodology and procedures. The topic may vary from year to year. Students taking CSC 200H may have additional reading, assignments or projects. 200H is required for the Honors B.S. in Computer Science. Students who participate or intend to participate in research are well advised to take CSC 200/200H.


CSC 200H1
Fatemeh Nargesian
MW 4:50PM  6:05PM


Intensive seminar on cooperative problem solving. Overview of the subdisciplines and the research of the University of Rochester’s computer science faculty. Instruction and practice on research methodology and procedures. The topic may vary from year to year. taking CSC 200H may have additional reading, assignments or projects. Students who participate or intend to participate in research are well advised to take CSC 200/200H. 200H is required for the Honors B.S. in Computer Science. CSC 200H students propose and complete a final project in cooperative problem solving in an area of computer science research. They are required to attend computer science department colloquiums when their schedule permits.


CSC 2891
Anson Kahng
MW 4:50PM  6:05PM


This class will provide an introduction to topics at the intersection of computer science and economics, including game theory, auctions, incentivecompatible mechanism design, matching algorithms, human computation (e.g., crowdsourcing and peer prediction), trust and reputation systems, and social choice (voting) theory. We hope to convey the fact that the relationship between computer science and economics is a twoway street: It is important to consider incentives and strategic action are important when designing computationintensive systems, and efficient and robust algorithms enable the deployment of impactful economic ideas. Prerequisites: Familiarity with probability theory, singlevariable calculus, linear algebra, and basics of theoretical computer science. No background in economic theory is assumed or required. Students should also be prepared to write code in Python. Please email the instructor with any questions.


CSC 1613
Andrew ReadMcFarland
MW 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1723
Eustrat Zhupa
MW 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 1725
Eustrat Zhupa
MW 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2781
John Criswell
MW 6:15PM  7:30PM


This course will teach students the foundations of computer security. Students will learn what security is, the design principles of secure systems, how security is enforced, and how security is compromised. Topics include access controls, information flow, basic applications of cryptography, buffer overflow attacks, and malware. Prerequisites: CSC 252 or CSC 452 or ECE 200.


Tuesday  
CSC 16112
Andrew ReadMcFarland
T 3:25PM  4:40PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 17113
Adam Purtee
T 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17114
Adam Purtee
T 4:50PM  6:05PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 273W1
Joseph Loporcaro
T 4:50PM  6:05PM


In this course, students prepare, critique, and discuss written materials relevant to Computer Science. Will count as one of the two upper level writing requirements for Computer Science majors. If the course is closed, DO NOT email the professor.


CSC 16113
Andrew ReadMcFarland
T 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 17115
Adam Purtee
T 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17116
Adam Purtee
T 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17213
Eustrat Zhupa
T 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17214
Eustrat Zhupa
T 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2822
Eustrat Zhupa
T 6:15PM  7:30PM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.


CSC 16114
Andrew ReadMcFarland
T 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 17118
Adam Purtee
T 7:40PM  8:55PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17215
Eustrat Zhupa
T 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17216
Eustrat Zhupa
T 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


Tuesday and Thursday  
CSC 2421
George Ferguson
TR 9:40AM  10:55AM


Introduces fundamental principles and techniques from Artificial Intelligence, including heuristic search, automated reasoning, handling uncertainty, and machine learning, to prepare students for advanced AI courses. Prerequisites: CSC 172 and MTH 150; CSC 173 STRONGLY Recommended. AUDITS NOT ALLOWED.


CSC 2491
Jiebo Luo
TR 9:40AM  10:55AM


Introduction to computer vision, including camera models, basic image processing, pattern and object recognition, and elements of human vision. Specific topics include geometric issues, statistical models, Hough transforms, color theory, texture, and optic flow. CSC 449, a graduatelevel course, requires additional readings and assignments. Prerequisites: MATH 161 and CSC 242; MATH 165 strongly recommended


CSC 2821
Eustrat Zhupa
TR 9:40AM  10:55AM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments. Prerequisites: (CSC 172 and MATH 150) or MATH172. Students MUST register for the recitation when registering for this course.


CSC 1701
Andrew ReadMcFarland
TR 11:05AM  12:20PM


An introduction to the World Wide Web and related technologies. Topics include HTML5 and CSS3, Progressive Enhancement, and Web page design. Emphasis is placed on fundamentals, industry standards and best practices. Additional topics include: web site construction techniques, mobile design issues, and Search Engine Optimization (SEO). Programming with JavaScript will be introduced.


CSC 1861
Thaddeus Pawlicki
TR 11:05AM  12:20PM


This course is a handson lab based introduction to software engineering and computer programming using the development of computer/video games as the application area. Topics will include mesh modeling, level design, asset management, shading, texturing, lighting, event scripting, character rigging, and particle effects.


CSC 2461
Adam Purtee
TR 11:05AM  12:20PM


Mathematical foundations of classification, regression, and decision making. Supervised algorithms covered include perceptrons, logistic regression, support vector machines, and neural networks. Directed and undirected graphical models. Numerical parameter optimization, including gradient descent, expectation maximization, and other methods. Introduction to reinforcement learning. Proofs covered as appropriate. Significant programming projects will be assigned. This course involves a lot of math and algorithms. You should know multivariable calculus, linear algebra, and some algorithms. No formal prerequisites but MATH 165, MATH 164, and CSC 242 strongly recommended.


CSC 2501
Scott Grimm
TR 11:05AM  12:20PM


This course addresses linguistic research questions through data science techniques. The course will focus on developing skills to (i) acquire and process a variety of language data, from using established corpora to capturing data in the wild, and (ii) to investigate language use, particularly syntactic and semantic phenomena, through descriptive and inferential statistical techniques. A significant part of the course will be devoted to handson projects and will include developing familiarity with using the programming languages Python and R to acquire and explore linguistic data. Familiarity with statistics and/or computational linguistics is advantageous, but not necessary. Prerequisites: LING 110, and either LING 210, LING 220 or LING 225.


CSC 2111
Zhen Bai
TR 12:30PM  1:45PM


The goal of this course is to provide an introductory overview of the concepts, principles, methods and special topics of HumanComputer Interaction (HCI). This course will help students to build a frame of reference of HCI approaches and apply them in conducting design practices for realworld problems. This course contains a combination of lectures, seminars and group projects. The lectures will cover origins of HCI and interaction design, usercentered design methods, usability evaluation and user experience. The seminars will be a combination of guest lecturers and studentled discussions to introduce special topics in HCI, which may include Augmented and Virtual Reality, Tangible User Interface, HumanRobot Interaction, learning technologies, and assistive technologies. The group project will take place throughout the course and provide an opportunity for students to apply and reflect on HCI methods and usercentered design processes through contextual inquiry, prototyping, evaluation, iteration and presentation. Prerequisite: CSC 172 (required), CSC 214 (desired), or permission of the instructor.


CSC 2951
Thaddeus Pawlicki
TR 12:30PM  1:45PM


This course covers special topics that are of current interest in the area of Quantum Computing. Topics vary by term.


CSC 1612
Andrew ReadMcFarland
TR 2:00PM  3:15PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 1711
Adam Purtee
TR 2:00PM  3:15PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC & DSCC majors.


CSC 1731
George Ferguson
TR 2:00PM  3:15PM


An introduction to some of the most important formal models of computation, and their application to realworld computing problems. Prerequisites: CSC 172 and MTH 150. AUDITS NOT ALLOWED.


CSC 1721
Eustrat Zhupa
TR 3:25PM  4:40PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required. Prerequisites: CSC 171 or equivalent, MATH 150. May be taken concurrently with MATH 150 if CSC 171 prerequisite is satisfied.


CSC 2101
Andrew ReadMcFarland
TR 3:25PM  4:40PM


The World Wide Web was born around 1990, so it is not much older than most of you. In this course, we will follow the growth of the Web from its toddler years, to early childhood, to its turbulent preteen and teenage years, and finally as it begins to mature as a young adult. Along this journey, you will learn influential Web technologies such as HTTP, HTML, JavaScript, CSS, the LAMP stack, XML, JSON, Ajax, WebSockets, and modern MVC frameworks. Even though you will be doing a lot of programming in this course, its purpose is not to teach you to become an expert in any particular language or framework. Web technologies change at a blistering pace, so specifics quickly get outdated. However, once you take this course and understand the fundamentals, you will be able to easily pick up new technologies on the fly. Prerequisites: CSC 172. *No audits will be allowed for this course


CSC 1611
Andrew ReadMcFarland
TR 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. This course is for nonmajors, and/or students with less math and science background. Lab and workshop required. This course may not be used for CSC major credit if completed after or at the same time as CSC171


CSC 1722
Eustrat Zhupa
TR 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2401
Thaddeus Pawlicki
TR 4:50PM  6:05PM


Fundamental concepts and techniques of data mining, including data attributes, data visualization, data preprocessing, mining frequent patterns, association and correlation, classification methods, and cluster analysis. Advanced topics include outlier detection, stream mining, and social media data mining. CSC 440, a graduatelevel course, requires additional readings and a course project. Prerequisites will be strictly enforced: CSC171, CSC 172 and MTH 161. Recommended: CSC 242 or CSC262; MTH165.


CSC 1615
Andrew ReadMcFarland
TR 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 2141
Arthur Roolfs
TR 6:15PM  7:30PM


Coursework covers user interface designs and functional algorithms for mobile devices (iOS summer/fall, Android spring) and unique user interactions using multitouch technologies. Objectoriented design including modelviewcontroller paradigm, memory management. Other topics include: objectoriented database API, animation, web services and performance considerations. Prerequisites: CSC 172


Wednesday  
CSC 2601
Ehsan Hoque
W 2:00PM  4:40PM


We currently add 51 billion tons of greenhouse gases to the atmosphere every year. We need to get it down to zero to stop the warming and avoid a cloud disaster. How? In this class, we will discuss and explore the role of technology to bring innovative breakthroughs to combat this unique challenge. Examples include the use of machine learning techniques to better predict climate, visualizing the effects of extreme weather to create awareness, monitoring the emission of carbon with satellite imagery. The lectures will consist of discussions, reading papers, guest lecturers, and a final project. Prerequisite: CSC 242.


CSC 17119
Adam Purtee
W 3:25PM  4:40PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17120
Adam Purtee
W 3:25PM  4:40PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 16115
Andrew ReadMcFarland
W 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16116
Andrew ReadMcFarland
W 4:50PM  6:05PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 17217
Eustrat Zhupa
W 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17218
Eustrat Zhupa
W 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 28011
Lane Hemaspaandra
W 4:50PM  6:05PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability.


CSC 2802
Lane Hemaspaandra
W 4:50PM  6:05PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites are CSC 173 and MTH 150.


CSC 16117
Andrew ReadMcFarland
W 6:15PM  7:30PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 17121
Adam Purtee
W 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17219
Eustrat Zhupa
W 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2803
Lane Hemaspaandra
W 6:15PM  7:30PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites include CSC 173 and MTH 150.


CSC 2807
Lane Hemaspaandra
W 6:15PM  7:30PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites are CSC 173 and MTH 150.


CSC 2823
Eustrat Zhupa
W 6:15PM  7:30PM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.


CSC 16118
Andrew ReadMcFarland
W 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16119
Andrew ReadMcFarland
W 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16120
Andrew ReadMcFarland
W 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 17220
Eustrat Zhupa
W 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 17221
Eustrat Zhupa
W 7:40PM  8:55PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2825
Eustrat Zhupa
W 7:40PM  8:55PM


How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divideandconquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NPcompleteness and linear programming. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.


Wednesday and Friday  
CSC 2521
Yuhao Zhu
WF 3:25PM  4:40PM


Introduction to computer architecture and the layering of hardware/software systems. Topics include instruction set design; logical building blocks; computer arithmetic; processor organization; the memory hierarchy (registers, caches, main memory, and secondary storage); I/Obuses, devices, and interrupts; microcode and assembly language; virtual machines; the roles of the assembler, linker, compiler, and operating system; technological trends and the future of computing hardware. Several programming assignments required. Prerequisites: MTH 150 and CSC 172


Thursday  
CSC 273W2
Joseph Loporcaro
R 2:00PM  3:15PM


In this course, students prepare, critique, and discuss written materials relevant to Computer Science. Will count as one of the two upper level writing requirements for Computer Science majors. If the course is closed, DO NOT email the professor.


CSC 2809
Lane Hemaspaandra
R 3:25PM  4:40PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites are CSC 173 and MTH 150


CSC 17222
Eustrat Zhupa
R 4:50PM  6:05PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2804
Lane Hemaspaandra
R 4:50PM  6:05PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites include CSC 173 and MTH 150


CSC 17122
Adam Purtee
R 6:15PM  7:30PM


Handson introduction to programming using the Java programming language. Teaches fundamentals of programming and more advanced topics. Emphasizes algorithmic thinking and computational problem solving and provides an introduction to the concepts and methods used in Computer Science. Required for all CSC majors.


CSC 17223
Eustrat Zhupa
R 6:15PM  7:30PM


Abstract data types (e.g., sets, mappings, and graphs) and their implementation as concrete data structures in Java. Analysis of the running times of programs operating on such data structures, and basic techniques for program design, analysis, and proof of correctness (e.g., induction and recursion). Lab and workshop required.


CSC 2805
Lane Hemaspaandra
R 6:15PM  7:30PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites include CSC 173 and MTH 150.


CSC 16121
Andrew ReadMcFarland
R 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 16122
Andrew ReadMcFarland
R 7:40PM  8:55PM


Handson introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as objectoriented programming and graphics. Recommended for nonmajors, and/or students with less math and science background. Lab and workshop required.


CSC 2808
Lane Hemaspaandra
R 7:40PM  8:55PM


This course studies fundamental computer models and their computational limitations. Finitestate machines and pumping lemmas, the contextfree languages, Turing machines, decidable and Turingrecognizable languages, undecidability, NPcompleteness. Prerequisites are CSC 173 and MTH 150.
