An Intro to Economics
An introduction to the core ideas economists use to understand the U.S.
An introduction to the core ideas economists use to understand the U.S.
An introduction to the core ideas economists use to understand the U.S.
An introduction to the core ideas economists use to understand the U.S.
An introduction to the core ideas economists use to understand the U.S.
Open to seniors with consent of the Department.
Spring semester. The Department.
How to handle overenrollment: null
Students who enroll in this course will likely encounter and be expected to engage in the following intellectual skills, modes of learning, and assessment: (none specified)
This course covers basic mathematical concepts that are essential in computer science and then uses them to teach the theory of formal languages and machine models of languages. The notion of computability will be introduced in order to discuss undecidable problems. The topics covered include: regular, context-free and context-sensitive languages, finite state automata, Turing machines, decidability, and computational complexity. Offered in alternate years.
Requisite: None, although analytical aptitude is essential. Limited to 50 students. Spring semester. Professor Riondato.
Computing hardware today is a complex and highly diverse landscape, but one common thread is the prevalence and scale of parallel computation. Scientific computing, generative AI, and other intensive modern computing tasks are made possible by rapidly evolving hardware capabilities, robust systems support, and effective programming.
This course will explore the theory and practice of automated logical reasoning. On the theoretical end, the course will cover widely-used logical theories and procedures for deciding the satisfiability of formulas in those theories. Topics will include propositional logic, first-order logic, linear arithmetic over reals and integers, theory of uninterpreted functions, bit-vector theory, and combinations of theories. On the practical end, the course will cover applications of logic in formal verification, theorem proving, and planning.
This course will cover the crucial responsibilities and mechanisms of operating system kernels, focusing on the themes of abstraction, virtualization, concurrency, caching, and persistence. Topics will include processes, memory management and virtual memory, multi-processing and threads, file systems, and virtual machines.
Requisite: COSC-112 and COSC-171 or COSC-175. Spring semester. Professor Kaplan
How to handle overenrollment: null
This course will cover the crucial responsibilities and mechanisms of operating system kernels, focusing on the themes of abstraction, virtualization, concurrency, caching, and persistence. Topics will include processes, memory management and virtual memory, multi-processing and threads, file systems, and virtual machines.
Requisite: COSC-112 and COSC-171 or COSC-175. Spring semester. Professor Kaplan
How to handle overenrollment: null