Computer Networking

This course covers advanced fundamental principles of computer networks, studying foundational material in the field. Topics include advanced network architecture, network algorithmics, network control, network measurement, and wireless networks. The goal of this course is to teach networking fundamentals/techniques that will be useful for years to come. Undergraduate background in networking, algorithms, probability theory, and optimization will be helpful.

Ideas That Change the World

In this seminar, students will examine texts and works of art that have profoundly shaped the world we live in. The course is divided into four units: Models of Inquiry; the Impact of Science and Technology; Social Philosophy and Civic Engagement; and Art in the World. The course is supplemented with a plenary lecture by a distinguished honors faculty speaker.

Ideas That Change the World

In this seminar, students will examine texts and works of art that have profoundly shaped the world we live in. The course is divided into four units: Models of Inquiry; the Impact of Science and Technology; Social Philosophy and Civic Engagement; and Art in the World. The course is supplemented with a plenary lecture by a distinguished honors faculty speaker.

Ideas That Change the World

In this seminar, students will examine texts and works of art that have profoundly shaped the world we live in. The course is divided into four units: Models of Inquiry; the Impact of Science and Technology; Social Philosophy and Civic Engagement; and Art in the World. The course is supplemented with a plenary lecture by a distinguished honors faculty speaker.

Ideas That Change the World

In this seminar, students will examine texts and works of art that have profoundly shaped the world we live in. The course is divided into four units: Models of Inquiry; the Impact of Science and Technology; Social Philosophy and Civic Engagement; and Art in the World. The course is supplemented with a plenary lecture by a distinguished honors faculty speaker.

Adv Logic in Computer Science

This course provides a rigorous introduction to mathematical logic from an algorithmic perspective. Topics include Propositional Logic: Horn Clause Satisfiability and SAT Solvers; First Order Logic: Soundness and Completeness of Resolution; Compactness Theorem; Automatic Theorem Proving; Model Checking. Students will learn the theory behind and use the following systems, languages, and tools: the Coq theorem prover, Datalog, the NuSMV Model Checker, and SAT and SMT solvers.
Subscribe to