Instructor Class Description

Time Schedule:

• Spring Quarter 2013
• Summer Quarter 2013
• Autumn Quarter 2013

Rajesh P.N. Rao
CSE 311
Seattle Campus

Foundations of Computing I

Examines fundamentals of logic, set theory, induction, and algebraic structures with applications to computing; finite state machines; and limits of computability. Prerequisite: CSE 143; either MATH 126 or MATH 136.

Class description

In this course, we will explore a smorgasbord of concepts that are fundamental to computing. We will delve into various facets of logic, set theory, induction, and algebraic structures, with an eye towards applications in computer science. We will study abstract models of computation and also briefly visit the dreaded world of uncomputable problems. The emphasis will be on developing a thorough mathematical understanding of these concepts and being able to think rigorously and analytically about computing problems.

Student learning goals

Logic & Set theory

Number theory

Induction

Graphs, Trees, & Circuits

Finite State Machines

Turing Machines and Computability

General method of instruction

White board lectures and slides

Recommended preparation

Class assignments and grading

Office of the Registrar
For problems and questions about this web page contact icd@u.washington.edu,
otherwise contact the instructor or department directly.
Modified:May 17, 2013