Fall Term Schedule
Fall 2025
Number | Title | Instructor | Time |
---|
CSC 131-1
Ted Pawlicki
TR 11:05AM - 12:20PM
|
A hands on introduction to 3D computer graphics and animation techniques taught from a user point of view. Topics include 3D modeling, animation, and simulation.
|
CSC 160-01
Adam Purtee
TR 4:50PM - 6:05PM
|
This experimental course will explore how AI can be safely, ethically, and effectively leveraged by students to enhance their ability to learn. Students will be expected to both collaboratively and independently pursue AI applications within their own domains of interest, and to participate in course discussions. Basic concepts of how AI systems work and how they are built will be covered at a general audience level. This course has no prerequisites and is open to all students.
|
CSC 161-1
Monika Polak
TR 11:05AM - 12:20PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-10
Monika Polak
R 2:00PM - 3:15PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-11
Monika Polak
R 4:50PM - 6:05PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-12
Monika Polak
R 7:40PM - 8:55PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-13
Monika Polak
T 3:25PM - 4:40PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-14
Monika Polak
T 6:15PM - 7:30PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-15
Monika Polak
TR 12:30PM - 1:45PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-16
Monika Polak
W 3:25PM - 4:40PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-17
Monika Polak
W 6:15PM - 7:30PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-18
Monika Polak
TR 4:50PM - 6:05PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-19
Monika Polak
MW 3:25PM - 4:40PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-20
Monika Polak
W 9:00AM - 10:15AM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-21
Monika Polak
M 9:00AM - 10:15AM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-22
Monika Polak
M 9:00AM - 10:15AM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-23
Monika Polak
W 2:00PM - 3:15PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-3
Monika Polak
U 1:30PM - 3:00PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-4
Monika Polak
U 7:30PM - 9:30PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-5
Monika Polak
M 10:25AM - 11:40AM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-6
Monika Polak
M 6:15PM - 7:30PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 161-8
Monika Polak
MW 12:30PM - 1:45PM
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
CSC 171-1
Eustrat Zhupa
MW 10:25AM - 11:40AM
|
Hands-on 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.
|
CSC 171-10
Eustrat Zhupa
M 7:40PM - 8:55PM
|
Hands-on 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.
|
CSC 171-11
Eustrat Zhupa
M 7:40PM - 8:55PM
|
Hands-on 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.
|
CSC 171-13
Eustrat Zhupa
MW 2:00PM - 3:15PM
|
Hands-on 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.
|
CSC 171-14
Eustrat Zhupa
T 3:25PM - 4:40PM
|
Hands-on 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.
|
CSC 171-15
Eustrat Zhupa
T 4:50PM - 6:05PM
|
Hands-on 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.
|
CSC 171-16
Eustrat Zhupa
T 6:15PM - 7:30PM
|
Hands-on 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.
|
CSC 171-17
Eustrat Zhupa
T 7:40PM - 8:55PM
|
Hands-on 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.
|
CSC 171-21
Eustrat Zhupa
TR 9:40AM - 10:55AM
|
Hands-on 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.
|
CSC 171-22
Eustrat Zhupa
TR 11:05AM - 12:20PM
|
Hands-on 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.
|
CSC 171-23
Eustrat Zhupa
TR 6:15PM - 7:30PM
|
Hands-on 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.
|
CSC 171-24
Eustrat Zhupa
W 3:25PM - 4:40PM
|
Hands-on 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.
|
CSC 171-27
Eustrat Zhupa
M 12:30PM - 1:45PM
|
Hands-on 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.
|
CSC 171-3
Eustrat Zhupa
W 2:00PM - 3:15PM
|
Hands-on 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.
|
CSC 171-4
Eustrat Zhupa
M 3:25PM - 4:40PM
|
Hands-on 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.
|
CSC 171-5
Eustrat Zhupa
M 3:25PM - 4:40PM
|
Hands-on 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.
|
CSC 171-6
Eustrat Zhupa
M 4:50PM - 6:05PM
|
Hands-on 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.
|
CSC 171-7
Eustrat Zhupa
M 6:15PM - 7:30PM
|
Hands-on 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.
|
CSC 171-9
Eustrat Zhupa
T 2:00PM - 3:15PM
|
Hands-on 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.
|
CSC 172-1
Ted Pawlicki
TR 9:40AM - 10:55AM
|
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).
|
CSC 172-10
Ted Pawlicki
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).
|
CSC 172-12
Ted Pawlicki
MW 9:00AM - 10:15AM
|
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).
|
CSC 172-14
Ted Pawlicki
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).
|
CSC 172-15
Ted Pawlicki
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).
|
CSC 172-16
Ted Pawlicki
MW 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).
|
CSC 172-18
Ted Pawlicki
R 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).
|
CSC 172-19
Ted Pawlicki
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).
|
CSC 172-2
Ted Pawlicki
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).
|
CSC 172-20
Ted Pawlicki
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).
|
CSC 172-21
Ted Pawlicki
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).
|
CSC 172-22
Ted Pawlicki
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).
|
CSC 172-25
Ted Pawlicki
TR 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).
|
CSC 172-27
Ted Pawlicki
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).
|
CSC 172-29
Ted Pawlicki
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).
|
CSC 172-3
Ted Pawlicki
T 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).
|
CSC 172-4
Ted Pawlicki
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).
|
CSC 172-5
Ted Pawlicki
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).
|
CSC 172-6
Ted Pawlicki
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).
|
CSC 172-7
Ted Pawlicki
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).
|
CSC 172-8
Ted Pawlicki
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).
|
CSC 172-9
Ted Pawlicki
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).
|
CSC 173-01
George Ferguson
MW 2:00PM - 3:15PM
|
An introduction to some of the most important formal models of computation and their application to real-world computing problems. Prerequisites: CSC 172 and MATH 150
|
CSC 212-1
Yukang Yan
TR 11:05AM - 12:20PM
|
The course will explore the design, implementation, and evaluation of user-driven prototypes to be used by real users. Students will study the theoretical methods for design and evaluation, including requirements gathering, survey design, ethnography, rapid prototyping, and evaluation techniques. The theoretical knowledge will be supplemented with hands-on group projects including a final project. The final project will involve interactions with real-users along with a working prototype which hopefully could be deployed and used by people beyond the scope of this course.
|
CSC 214-1
Arthur Roolfs
TR 6:15PM - 7:30PM
|
Coursework covers user interface designs and functional algorithms for mobile devices (iOS fall, Android spring) and unique user interactions using multi-touch technologies. Object-oriented design using model-view-controller paradigm, memory management. Other topics include: object-oriented database API, animation, multi-threading and performance considerations. Prerequisite: CSC 172
|
CSC 227-01
Irving Barron Martinez
MW 10:25AM - 11:40AM
|
This course will introduce the students to the basic concepts of digital image processing, and establish a good foundation for further study and research in this field. The theoretical components of this course will be presented at a level that seniors and first year graduate students who have taken introductory courses in vectors, matrices, probability, statistics, linear systems, and computer programming should be comfortable with. Topics cover in this course will include intensity transformation and spatial filtering, filtering in the frequency domain, image restoration, morphological image processing, image segmentation, image registration, and image compression. The course will also provide a brief introduction to python (ipython), the primary programming language that will be used for solving problems in class as well as take-home assignments. Prerequisites: ECE 242 and ECE 440 & ECE 446 are recommended or permission of instructor
|
CSC 240-01
Cantay Caliskan
TR 3:25PM - 4:40PM
|
Fundamental concepts and techniques of data mining, including data attributes, data visualization, data pre-processing, 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 graduate-level course, requires additional readings and a course project. Prerequisites will be strictly enforced: CSC171, CSC 172 and MATH 161 Recommended: CSC 242 or CSC262 and MATH165
|
CSC 241-01
Ralf Haefner
TR 12:30PM - 1:45PM
|
This is a rotating topics course that includes the study of both the computations performed by the brain and of computational models of neuronal responses. Primary focus will be on the visual system. This course is taught at an introductory level in odd numbered years and an advanced level in even numbered years.
|
CSC 242-01
Ted Pawlicki
TR 3:25PM - 4:40PM
|
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.
|
CSC 245-01
Chenliang Xu
TR 9:40AM - 10:55AM
|
Much of the recent advances in machine learning and artificial intelligence have been dominated by neural network approaches broadly described as deep learning. This course provides an overview of the most important deep learning techniques covering both theoretical foundations and practical applications. The applications focus on problems in image understanding and language modeling utilizing state-of-the-art deep learning libraries and tools, which are introduced in the course. Prerequisites: MATH 164, MATH 165, and CSC 172. Programming in Python.
|
CSC 246-01
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. Prerequisites: MATH 165 and a complete calculus sequence (e.g., MATH 14x, 16x, or 17x). Recommended: STAT 190 or similar statistics course
|
CSC 252-01
Yanan Guo
MW 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: MATH 150 and CSC 172
|
CSC 253-01
Chen Ding
MW 3:25PM - 4:40PM
|
Modern software is complex and more than a single person can fully comprehend. This course teaches collaborative programming which is multi-person construction of software where each person's contribution is non-trivial and clearly defined and documented. The material to study includes design principles, safe and modular programming in modern programming languages including Rust, software teams and development processes, design patterns, and productivity tools. The assignments include collaborative programming and software design and development in teams. Students in CSC 453 have additional reading and requirements.Prerequisites: CSC 172 Data Structures and Algorithms, or equivalent for CSC 253. CSC 172 and CSC 252 or equivalent for CSC 453.
|
CSC 254-01
Michael Scott
MW 10:25AM - 11:40AM
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
CSC 254-03
Michael Scott
R 3:25PM - 4:40PM
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
CSC 254-04
Michael Scott
R 6:15PM - 7:30PM
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
CSC 254-08
Michael Scott
W 4:50PM - 6:05PM
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
CSC 254-10
Michael Scott
W 6:15PM - 7:30PM
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
CSC 254-12
Michael Scott
W 3:25PM - 4:40PM
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
CSC 256-1
John Criswell
TR 2:00PM - 3:15PM
|
Principles of operating system design, explored within the practical context of traditional, embedded, distributed, and real-time operating systems. Topics include device management, process management, scheduling, synchronization principles, memory management and virtual memory, file management and remote files, protection and security, fault tolerance, networks, and distributed computing. CSC 456, a graduate-level course, requires additional readings and assignments.
|
CSC 257-1
Andrew Read-McFarland
MW 4:50PM - 6:05PM
|
Introduction to computer networks and computer communication: Architecture and Protocols:. Design of protocols for error recovery, reliable delivery, routing and congestion control. Store-and-forward networks, satellite networks, local area networks and locally distributed systems. Case studies of networks, protocols and protocol families. Emphasis on software design issues in computer communication.
|
CSC 259-1
Yuhao Zhu
WF 2:00PM - 3:15PM
|
We will first study the fundamental building blocks of visual computing, including human visual system, camera imaging, computer graphics, image/video compression, and display technologies. We will then explore application domains that build on top of these fundamental building blocks such as Augmented/Virtual Reality, computational photography, autonomous machines, and digital cultural heritage. The course will necessarily span many scientific and engineering domains such as visual neuroscience, cognition, optics, signal processing, and computer systems.
|
CSC 261-01
Eustrat Zhupa
MW 12:30PM - 1:45PM
|
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 semester-long group project.
|
CSC 264-1
Zhiyao Duan
TR 12:30PM - 1:45PM
|
Computer audition is the study of how to design a computational system that can analyze and process auditory scenes. Example problems in this field include source separation (splitting audio mixtures into individual source tracks), pitch estimation (estimating the pitches played by each instrument), timbre modeling (finding features to distinguish different kinds of instruments), and source localization (finding where the sound comes from). This course will cover both fundamentals and state-of-the-art research in this field, which applies various kinds of signal processing and machine learning techniques. Multiple programming assignments will help students practice what they learn, and a final research project will lead students through the entire research process. Prerequisites: ECE 246/446 or ECE 272/472 or other equivalent signal processing courses, and Python/Matlab programming. Knowledge of machine learning techniques such as Markov models, support vector machines and neural networks is also helpful, but not required.
|
CSC 273W-01
Joseph Loporcaro
T 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 273W-02
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 276-01
Yanan Guo
MW 4:50PM - 6:05PM
|
This course delves into advanced topics in computer architecture such as out-of-order execution, speculative execution, cache protocols, and advanced memory techniques. It will also introduce the security problems caused by these designs, such as side-channel attacks, Rowhammer attacks, and Spectre/Meltdown vulnerabilities. Students will learn about the design of modern processors and their impact on performance and security.
|
CSC 277-01
Christopher Kanan
MW 3:25PM - 4:40PM
|
Deep learning systems are now being widely productionized at large corporations and many AI-centric start-ups have been created. Productionizing AI systems requires more than just algorithmic considerations. We need to organize the data for training these systems, measure the bias present in these systems after training them, monitor them over time, and more. This course covers these topics, including, but are not limited to, deploying AI systems, MLOps, model versioning, dataset curation, data management, AI ethics/fairness, detecting and mitigation of bias, detecting out-of-distribution inputs, domain shift, data-centric AI, real-time machine learning, continual machine learning, monitoring AI systems after deployment, model/data parallelism, managing AI projects/teams, training and inference on edge-devices, and launching AI start-ups.
|
CSC 280-01
Monika Polak
MW 2:00PM - 3:15PM
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
CSC 280-03
Monika Polak
W 4:50PM - 6:05PM
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
CSC 280-04
Monika Polak
W 6:15PM - 7:30PM
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
CSC 280-06
Monika Polak
R 6:15PM - 7:30PM
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
CSC 280-08
Monika Polak
R 3:25PM - 4:15PM
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
CSC 281-1
Andrew Read-McFarland
MW 9:00AM - 10:15AM
|
The modern study of cryptography investigates techniques for facilitating interactions between distrustful entities. In this course we introduce some of the fundamental concepts of this study. Emphasis will be placed on the foundations of cryptography and in particular on precise definitions and proof techniques.
|
CSC 282-01
Daniel Stefankovic
TR 11:05AM - 12:20PM
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
CSC 282-02
Daniel Stefankovic
T 6:15PM - 7:30PM
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
CSC 282-03
Daniel Stefankovic
W 6:15PM - 7:30PM
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
CSC 282-04
Daniel Stefankovic
M 6:15PM - 7:30PM
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
CSC 282-05
Daniel Stefankovic
W 7:40PM - 8:55PM
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
CSC 284-1
Daniel Stefankovic
MW 4:50PM - 6:05PM
|
Advanced study of design and analysis of algorithms. Topics typically include: combinatorial optimization, computational geometry, number-theoretic algorithms, probabilistic analysis and randomized algorithms, string algorithms, streaming algorithms. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.
|
CSC 289-01
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, incentive-compatible 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 two-way street: It is important to consider incentives and strategic action are important when designing computation-intensive systems, and efficient and robust algorithms enable the deployment of impactful economic ideas.
|
CSC 290-1
Sreepathi Pai
MW 9:00AM - 10:15AM
|
This advanced course is aimed at students who wish to build and use efficient large-scale AI systems. It condenses CSC 252, CSC 254, CSC 258, and CSC 255, collating material from those courses that are most relevant to modern AI systems. Topics covered include machine learning (ML) applications, ML programming models, code generation and optimization, manual and automatic parallelization, performance modeling, systems-level challenges, and specialized AI hardware. No background in AI or ML is expected, but proficiency in programming is expected. Prerequisites: CSC 173, CSC 242
|
CSC 297-01
George Ferguson
TR 9:40AM - 10:55AM
|
This course will explore important topics in computer science through student presentations. DO NOT register for this course if you do not want to present in class AND participate in the presentations of others. Prerequisites: four of the core Computer Science courses. The core courses for Computer Science are CSC 173, CSC 242, CSC 252, CSC 254, CSC 280, and CSC 282. Attendance is required. DO NOT register for this course if you will not attend class.
|
CSC 299W-1
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 anti-social behavior; major disruptions in the job market; and the large-scale concentration of risk into systems capable of catastrophic failure. In this discussion- and writing-oriented 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 386V-1
Chenliang Xu
|
No description
|
CSC 391-1
|
Registration for Independent Study courses needs to be completed through the Independent Study Form
|
CSC 392-1
|
Registration for Independent Study courses needs to be completed thru the instructions for online independent study registration.
|
CSC 394-1
Adam Purtee
|
No description
|
CSC 395-1
Zhen Bai
|
Registration for Independent Study courses needs to be completed through the Independent Study Form
|
Fall 2025
Number | Title | Instructor | Time |
---|---|
Monday | |
CSC 161-21
Monika Polak
M 9:00AM - 10:15AM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 161-22
Monika Polak
M 9:00AM - 10:15AM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 161-5
Monika Polak
M 10:25AM - 11:40AM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 171-27
Eustrat Zhupa
M 12:30PM - 1:45PM
|
|
Hands-on 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.
|
|
CSC 171-4
Eustrat Zhupa
M 3:25PM - 4:40PM
|
|
Hands-on 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.
|
|
CSC 171-5
Eustrat Zhupa
M 3:25PM - 4:40PM
|
|
Hands-on 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.
|
|
CSC 172-5
Ted Pawlicki
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).
|
|
CSC 171-6
Eustrat Zhupa
M 4:50PM - 6:05PM
|
|
Hands-on 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.
|
|
CSC 172-6
Ted Pawlicki
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).
|
|
CSC 161-6
Monika Polak
M 6:15PM - 7:30PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 171-7
Eustrat Zhupa
M 6:15PM - 7:30PM
|
|
Hands-on 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.
|
|
CSC 172-7
Ted Pawlicki
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).
|
|
CSC 172-8
Ted Pawlicki
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).
|
|
CSC 282-04
Daniel Stefankovic
M 6:15PM - 7:30PM
|
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
|
CSC 171-10
Eustrat Zhupa
M 7:40PM - 8:55PM
|
|
Hands-on 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.
|
|
CSC 171-11
Eustrat Zhupa
M 7:40PM - 8:55PM
|
|
Hands-on 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.
|
|
CSC 172-10
Ted Pawlicki
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).
|
|
CSC 172-2
Ted Pawlicki
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).
|
|
Monday and Wednesday | |
CSC 172-12
Ted Pawlicki
MW 9:00AM - 10:15AM
|
|
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).
|
|
CSC 281-1
Andrew Read-McFarland
MW 9:00AM - 10:15AM
|
|
The modern study of cryptography investigates techniques for facilitating interactions between distrustful entities. In this course we introduce some of the fundamental concepts of this study. Emphasis will be placed on the foundations of cryptography and in particular on precise definitions and proof techniques.
|
|
CSC 290-1
Sreepathi Pai
MW 9:00AM - 10:15AM
|
|
This advanced course is aimed at students who wish to build and use efficient large-scale AI systems. It condenses CSC 252, CSC 254, CSC 258, and CSC 255, collating material from those courses that are most relevant to modern AI systems. Topics covered include machine learning (ML) applications, ML programming models, code generation and optimization, manual and automatic parallelization, performance modeling, systems-level challenges, and specialized AI hardware. No background in AI or ML is expected, but proficiency in programming is expected. Prerequisites: CSC 173, CSC 242
|
|
CSC 171-1
Eustrat Zhupa
MW 10:25AM - 11:40AM
|
|
Hands-on 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.
|
|
CSC 227-01
Irving Barron Martinez
MW 10:25AM - 11:40AM
|
|
This course will introduce the students to the basic concepts of digital image processing, and establish a good foundation for further study and research in this field. The theoretical components of this course will be presented at a level that seniors and first year graduate students who have taken introductory courses in vectors, matrices, probability, statistics, linear systems, and computer programming should be comfortable with. Topics cover in this course will include intensity transformation and spatial filtering, filtering in the frequency domain, image restoration, morphological image processing, image segmentation, image registration, and image compression. The course will also provide a brief introduction to python (ipython), the primary programming language that will be used for solving problems in class as well as take-home assignments. Prerequisites: ECE 242 and ECE 440 & ECE 446 are recommended or permission of instructor
|
|
CSC 254-01
Michael Scott
MW 10:25AM - 11:40AM
|
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
|
CSC 161-8
Monika Polak
MW 12:30PM - 1:45PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 261-01
Eustrat Zhupa
MW 12:30PM - 1:45PM
|
|
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 semester-long group project.
|
|
CSC 171-13
Eustrat Zhupa
MW 2:00PM - 3:15PM
|
|
Hands-on 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.
|
|
CSC 172-14
Ted Pawlicki
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).
|
|
CSC 173-01
George Ferguson
MW 2:00PM - 3:15PM
|
|
An introduction to some of the most important formal models of computation and their application to real-world computing problems. Prerequisites: CSC 172 and MATH 150
|
|
CSC 280-01
Monika Polak
MW 2:00PM - 3:15PM
|
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
|
CSC 161-19
Monika Polak
MW 3:25PM - 4:40PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 172-15
Ted Pawlicki
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).
|
|
CSC 252-01
Yanan Guo
MW 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: MATH 150 and CSC 172
|
|
CSC 253-01
Chen Ding
MW 3:25PM - 4:40PM
|
|
Modern software is complex and more than a single person can fully comprehend. This course teaches collaborative programming which is multi-person construction of software where each person's contribution is non-trivial and clearly defined and documented. The material to study includes design principles, safe and modular programming in modern programming languages including Rust, software teams and development processes, design patterns, and productivity tools. The assignments include collaborative programming and software design and development in teams. Students in CSC 453 have additional reading and requirements.Prerequisites: CSC 172 Data Structures and Algorithms, or equivalent for CSC 253. CSC 172 and CSC 252 or equivalent for CSC 453.
|
|
CSC 277-01
Christopher Kanan
MW 3:25PM - 4:40PM
|
|
Deep learning systems are now being widely productionized at large corporations and many AI-centric start-ups have been created. Productionizing AI systems requires more than just algorithmic considerations. We need to organize the data for training these systems, measure the bias present in these systems after training them, monitor them over time, and more. This course covers these topics, including, but are not limited to, deploying AI systems, MLOps, model versioning, dataset curation, data management, AI ethics/fairness, detecting and mitigation of bias, detecting out-of-distribution inputs, domain shift, data-centric AI, real-time machine learning, continual machine learning, monitoring AI systems after deployment, model/data parallelism, managing AI projects/teams, training and inference on edge-devices, and launching AI start-ups.
|
|
CSC 299W-1
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 anti-social behavior; major disruptions in the job market; and the large-scale concentration of risk into systems capable of catastrophic failure. In this discussion- and writing-oriented 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 172-16
Ted Pawlicki
MW 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).
|
|
CSC 257-1
Andrew Read-McFarland
MW 4:50PM - 6:05PM
|
|
Introduction to computer networks and computer communication: Architecture and Protocols:. Design of protocols for error recovery, reliable delivery, routing and congestion control. Store-and-forward networks, satellite networks, local area networks and locally distributed systems. Case studies of networks, protocols and protocol families. Emphasis on software design issues in computer communication.
|
|
CSC 276-01
Yanan Guo
MW 4:50PM - 6:05PM
|
|
This course delves into advanced topics in computer architecture such as out-of-order execution, speculative execution, cache protocols, and advanced memory techniques. It will also introduce the security problems caused by these designs, such as side-channel attacks, Rowhammer attacks, and Spectre/Meltdown vulnerabilities. Students will learn about the design of modern processors and their impact on performance and security.
|
|
CSC 284-1
Daniel Stefankovic
MW 4:50PM - 6:05PM
|
|
Advanced study of design and analysis of algorithms. Topics typically include: combinatorial optimization, computational geometry, number-theoretic algorithms, probabilistic analysis and randomized algorithms, string algorithms, streaming algorithms. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.
|
|
CSC 289-01
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, incentive-compatible 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 two-way street: It is important to consider incentives and strategic action are important when designing computation-intensive systems, and efficient and robust algorithms enable the deployment of impactful economic ideas.
|
|
Tuesday | |
CSC 171-9
Eustrat Zhupa
T 2:00PM - 3:15PM
|
|
Hands-on 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.
|
|
CSC 273W-01
Joseph Loporcaro
T 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 161-13
Monika Polak
T 3:25PM - 4:40PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 171-14
Eustrat Zhupa
T 3:25PM - 4:40PM
|
|
Hands-on 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.
|
|
CSC 171-15
Eustrat Zhupa
T 4:50PM - 6:05PM
|
|
Hands-on 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.
|
|
CSC 172-3
Ted Pawlicki
T 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).
|
|
CSC 273W-02
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 161-14
Monika Polak
T 6:15PM - 7:30PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 171-16
Eustrat Zhupa
T 6:15PM - 7:30PM
|
|
Hands-on 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.
|
|
CSC 172-20
Ted Pawlicki
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).
|
|
CSC 282-02
Daniel Stefankovic
T 6:15PM - 7:30PM
|
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
|
CSC 171-17
Eustrat Zhupa
T 7:40PM - 8:55PM
|
|
Hands-on 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.
|
|
CSC 172-21
Ted Pawlicki
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).
|
|
CSC 172-22
Ted Pawlicki
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).
|
|
Tuesday and Thursday | |
CSC 171-21
Eustrat Zhupa
TR 9:40AM - 10:55AM
|
|
Hands-on 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.
|
|
CSC 172-1
Ted Pawlicki
TR 9:40AM - 10:55AM
|
|
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).
|
|
CSC 245-01
Chenliang Xu
TR 9:40AM - 10:55AM
|
|
Much of the recent advances in machine learning and artificial intelligence have been dominated by neural network approaches broadly described as deep learning. This course provides an overview of the most important deep learning techniques covering both theoretical foundations and practical applications. The applications focus on problems in image understanding and language modeling utilizing state-of-the-art deep learning libraries and tools, which are introduced in the course. Prerequisites: MATH 164, MATH 165, and CSC 172. Programming in Python.
|
|
CSC 297-01
George Ferguson
TR 9:40AM - 10:55AM
|
|
This course will explore important topics in computer science through student presentations. DO NOT register for this course if you do not want to present in class AND participate in the presentations of others. Prerequisites: four of the core Computer Science courses. The core courses for Computer Science are CSC 173, CSC 242, CSC 252, CSC 254, CSC 280, and CSC 282. Attendance is required. DO NOT register for this course if you will not attend class.
|
|
CSC 131-1
Ted Pawlicki
TR 11:05AM - 12:20PM
|
|
A hands on introduction to 3D computer graphics and animation techniques taught from a user point of view. Topics include 3D modeling, animation, and simulation.
|
|
CSC 161-1
Monika Polak
TR 11:05AM - 12:20PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 171-22
Eustrat Zhupa
TR 11:05AM - 12:20PM
|
|
Hands-on 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.
|
|
CSC 212-1
Yukang Yan
TR 11:05AM - 12:20PM
|
|
The course will explore the design, implementation, and evaluation of user-driven prototypes to be used by real users. Students will study the theoretical methods for design and evaluation, including requirements gathering, survey design, ethnography, rapid prototyping, and evaluation techniques. The theoretical knowledge will be supplemented with hands-on group projects including a final project. The final project will involve interactions with real-users along with a working prototype which hopefully could be deployed and used by people beyond the scope of this course.
|
|
CSC 246-01
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. Prerequisites: MATH 165 and a complete calculus sequence (e.g., MATH 14x, 16x, or 17x). Recommended: STAT 190 or similar statistics course
|
|
CSC 282-01
Daniel Stefankovic
TR 11:05AM - 12:20PM
|
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
|
CSC 161-15
Monika Polak
TR 12:30PM - 1:45PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 241-01
Ralf Haefner
TR 12:30PM - 1:45PM
|
|
This is a rotating topics course that includes the study of both the computations performed by the brain and of computational models of neuronal responses. Primary focus will be on the visual system. This course is taught at an introductory level in odd numbered years and an advanced level in even numbered years.
|
|
CSC 264-1
Zhiyao Duan
TR 12:30PM - 1:45PM
|
|
Computer audition is the study of how to design a computational system that can analyze and process auditory scenes. Example problems in this field include source separation (splitting audio mixtures into individual source tracks), pitch estimation (estimating the pitches played by each instrument), timbre modeling (finding features to distinguish different kinds of instruments), and source localization (finding where the sound comes from). This course will cover both fundamentals and state-of-the-art research in this field, which applies various kinds of signal processing and machine learning techniques. Multiple programming assignments will help students practice what they learn, and a final research project will lead students through the entire research process. Prerequisites: ECE 246/446 or ECE 272/472 or other equivalent signal processing courses, and Python/Matlab programming. Knowledge of machine learning techniques such as Markov models, support vector machines and neural networks is also helpful, but not required.
|
|
CSC 172-25
Ted Pawlicki
TR 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).
|
|
CSC 256-1
John Criswell
TR 2:00PM - 3:15PM
|
|
Principles of operating system design, explored within the practical context of traditional, embedded, distributed, and real-time operating systems. Topics include device management, process management, scheduling, synchronization principles, memory management and virtual memory, file management and remote files, protection and security, fault tolerance, networks, and distributed computing. CSC 456, a graduate-level course, requires additional readings and assignments.
|
|
CSC 240-01
Cantay Caliskan
TR 3:25PM - 4:40PM
|
|
Fundamental concepts and techniques of data mining, including data attributes, data visualization, data pre-processing, 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 graduate-level course, requires additional readings and a course project. Prerequisites will be strictly enforced: CSC171, CSC 172 and MATH 161 Recommended: CSC 242 or CSC262 and MATH165
|
|
CSC 242-01
Ted Pawlicki
TR 3:25PM - 4:40PM
|
|
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.
|
|
CSC 160-01
Adam Purtee
TR 4:50PM - 6:05PM
|
|
This experimental course will explore how AI can be safely, ethically, and effectively leveraged by students to enhance their ability to learn. Students will be expected to both collaboratively and independently pursue AI applications within their own domains of interest, and to participate in course discussions. Basic concepts of how AI systems work and how they are built will be covered at a general audience level. This course has no prerequisites and is open to all students.
|
|
CSC 161-18
Monika Polak
TR 4:50PM - 6:05PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 171-23
Eustrat Zhupa
TR 6:15PM - 7:30PM
|
|
Hands-on 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.
|
|
CSC 214-1
Arthur Roolfs
TR 6:15PM - 7:30PM
|
|
Coursework covers user interface designs and functional algorithms for mobile devices (iOS fall, Android spring) and unique user interactions using multi-touch technologies. Object-oriented design using model-view-controller paradigm, memory management. Other topics include: object-oriented database API, animation, multi-threading and performance considerations. Prerequisite: CSC 172
|
|
Wednesday | |
CSC 161-20
Monika Polak
W 9:00AM - 10:15AM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 161-23
Monika Polak
W 2:00PM - 3:15PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 171-3
Eustrat Zhupa
W 2:00PM - 3:15PM
|
|
Hands-on 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.
|
|
CSC 161-16
Monika Polak
W 3:25PM - 4:40PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 171-24
Eustrat Zhupa
W 3:25PM - 4:40PM
|
|
Hands-on 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.
|
|
CSC 254-12
Michael Scott
W 3:25PM - 4:40PM
|
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
|
CSC 172-27
Ted Pawlicki
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).
|
|
CSC 254-08
Michael Scott
W 4:50PM - 6:05PM
|
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
|
CSC 280-03
Monika Polak
W 4:50PM - 6:05PM
|
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
|
CSC 161-17
Monika Polak
W 6:15PM - 7:30PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 172-4
Ted Pawlicki
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).
|
|
CSC 254-10
Michael Scott
W 6:15PM - 7:30PM
|
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
|
CSC 280-04
Monika Polak
W 6:15PM - 7:30PM
|
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
|
CSC 282-03
Daniel Stefankovic
W 6:15PM - 7:30PM
|
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
|
CSC 172-29
Ted Pawlicki
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).
|
|
CSC 282-05
Daniel Stefankovic
W 7:40PM - 8:55PM
|
|
How does one design programs and ascertain their efficiency? Greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness 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.
|
|
Wednesday and Friday | |
CSC 259-1
Yuhao Zhu
WF 2:00PM - 3:15PM
|
|
We will first study the fundamental building blocks of visual computing, including human visual system, camera imaging, computer graphics, image/video compression, and display technologies. We will then explore application domains that build on top of these fundamental building blocks such as Augmented/Virtual Reality, computational photography, autonomous machines, and digital cultural heritage. The course will necessarily span many scientific and engineering domains such as visual neuroscience, cognition, optics, signal processing, and computer systems.
|
|
Thursday | |
CSC 161-10
Monika Polak
R 2:00PM - 3:15PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 172-18
Ted Pawlicki
R 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).
|
|
CSC 254-03
Michael Scott
R 3:25PM - 4:40PM
|
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
|
CSC 280-08
Monika Polak
R 3:25PM - 4:15PM
|
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
|
CSC 161-11
Monika Polak
R 4:50PM - 6:05PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|
|
CSC 172-19
Ted Pawlicki
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).
|
|
CSC 172-9
Ted Pawlicki
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).
|
|
CSC 254-04
Michael Scott
R 6:15PM - 7:30PM
|
|
Design and implementation of programming languages, with an emphasis on imperative languages and on implementation tradeoffs. In-depth examination of 'how programming languages work.' Topics include fundamental language concepts (names, values, types, abstraction, control flow); compilation and interpretation (syntactic and semantic analysis, code generation and optimization); major language paradigms (imperative, object-oriented, functional, logic-based, concurrent). Course projects include assignments in several different languages, with an emphasis on compilation issues. Prerequisites: CSC 173 and CSC 252 Computer Organization, or equivalent.
|
|
CSC 280-06
Monika Polak
R 6:15PM - 7:30PM
|
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability. Prerequisites: CSC 173 Computation and Formal Systems, and MATH 150 Discrete Mathematics
|
|
CSC 161-12
Monika Polak
R 7:40PM - 8:55PM
|
|
Hands-on introduction to programming using the Python programming language. Covers basic programming constructs including statements, expressions, variables, conditionals, iteration, and functions, as well as object-oriented programming and graphics.
|