CSE 311: Foundations of Computing
about the course
Fall 2013
Lecture 1: Propositional logic
We will study

Logic
Formal proofs
Set theory and functions
Basic number theory
Induction
CS structures: regular expressions, grammars,
graphs, finite state machi
CSE 311: Foundations of Computing
announcements
Fall 2013
Lecture 9: Set theory and functions
Reading assignment
Set theory
2.12.3 (both editions)
set theory
Formal treatment dates from late 19th century
Direct ties between set theory and logic
Import
University of Washington
Department of Computer Science and Engineering
CSE 311, Spring 2013
June 8, 2013
Solutions Homework 8
Problem 1:
Apply the state minimization algorithm from the lectures to the FSM below. Write out the groups
of states that you be
University of Washington
Department of Computer Science and Engineering
CSE 311, Autum, 2012
November 2, 2012
Sample midterm questions
Instructions:
Exam will consist of 5 to 8 questions.
Closed book, closed notes, no cell phones, no calculators.
Time
University of Washington
Department of Computer Science and Engineering
CSE 311, Spring 2013
May 3, 2013
Sample midterm questions
Instructions:
Exam will consist of 5 to 8 questions.
Closed book, closed notes, no cell phones, no calculators.
Time limit
CSE 311: Foundations of Computing I
Sample midterm
1. Prime factorization (4 points) Compute the prime factorization of 320 and 450. Compute gcd(320, 450)
and lcm(320, 450), expressing your answer as a product of prime factors.
2. Sets (12 points) Let A =
CSE 311: Foundations of Computing I
Sample midterm  with solutions
1. Prime factorization (4 points) Compute the prime factorization of 320 and 450. Compute gcd(320, 450)
and lcm(320, 450), expressing your answer as a product of prime factors.
320 = 26 5
Name
Student ID
CSE 311: Foundations of Computing I
Spring 2011
Midterm
Instructions
1. Start at the 1:30PM bell and stop at the 2:20PM bell.
2. There are 7 questions, worth a total of 100 points.
3. Write your name and student ID on the rst sheet (once y
Name
Student ID
CSE 311: Foundations of Computing I
Spring 2011
Midterm  with solutions
1. Sets (12 points)
(a) Let A, B, C be sets. Express A(BC) using only symbols from this list: (, ), , , A, B, C, A, B, C.
(b) Prove or give a counterexample: for a