Introduction to Computing In this course we will provide a broad introductory overview of the discipline of computer science, with no prerequisites or assumed prior knowledge of computers or programming. A significant component of the course is an introduction to algorithmic concepts and to programming using Python; programming assignments will explore algorithmic strategies such as selection, iteration, divide-and-conquer, and recursion, as well as introducing the Python programming language. Additional topics will include: the structure and organization of computers, the Internet and World Wide Web, abstraction as a means of managing complexity, social and ethical computing issues, and the question "What is computation?" (Juniors and Seniors by waiver) (formerly CSCI 0101) 3 hr. lect./1 hr. lab

Data Structures In this course we will study the ideas and structures helpful in designing algorithms and writing programs for solving large, complex problems. The Java programming language and object-oriented paradigm are introduced in the context of important abstract data types (ADTs) such as stacks, queues, trees, and graphs. We will study efficient implementations of these ADTs, and learn classic algorithms to manipulate these structures for tasks such as sorting and searching. Prior programming experience is expected, but prior familiarity with the Java programming language is not assumed. (CSCI 0145 or CSCI 0146 or CSCI 0150)

Theory of Computation This course explores the nature of computation and what it means to compute. We study important models of computation (finite automata, push-down automata, and Turing machines) and investigate their fundamental computational power. We examine various problems and try to determine the computational power needed to solve them. Topics include deterministic versus non-deterministic computation, and a theoretical basis for the study of NP-completeness.

Computing for the Sciences In this course we will provide an introduction to the field of computer science geared towards students interested in mathematics and the natural sciences. We will study problem-solving approaches and computational techniques utilized in a variety of domains including biology, chemistry, physics, and engineering. Students will learn how to program in Python and other languages, how to extract information from large data sets, and how to utilize a variety of tools employed in scientific computation. The course has no prerequisites and assumes no prior experience with programming or computer science.

Amy Briggs

Reviews and ratings for Amy Briggs at Middlebury College.Amy Briggs teaches Introduction to Computing, Data Structures, Theory of Computation and more.  Explore top rated instructors and find the best for you.Is Amy Briggs good ? Find out on MiddCourses.

Prof Briggs is really keen on helping students and answering questions, however her teaching style is not really straight-forward as she doesn’t explain basic concepts very well (esp for beginners). Lots of homework and weekly quizzes but she’s very accomodating and a lenient grader

The course was pretty slow pace initially especially if you learned java through AP computer science A. However, the course gets pretty tough after the first mid term. A lot of methods and programming that requires recursion. I did not have briggs, I had professor Biester. 

I took this class in Fall of 2025, and I thought it was super interesting. It starts with an overview of Java, which is pretty fast paced (would recommend you know some Java before taking). Once you get to the actual data structures part it becomes more manageable, but only if you are very solid on the Java part. 8/10