CS103
Fall 2014
Handout 09
October 3, 2014
Problem Set 2
This second problem set is all about induction and its sheer breadth of applications. By the time
you're done with this problem set, you will h
Handout #4
March 28, 2011
CS103
Robert Plummer
Problem Set #1 - Due Monday, April 4 in class
Here are the homework policies for this class:
1. All assignments are due in class.
2. Be sure to put your
Homework 8
Due: Friday, March 7, 2014
CS 103, Winter 2013-2014
These questions require thought, but do not require long answers. Please be
as concise as possible.
Please include your SUNet ID in you
Homework 2
Due: Friday, April 19, 2013
CS103, Spring 2012-2013
Monday 4/15 5:30 p.m.: Problem 6 has been cancelled. All students will get
full credit on this problem.
These questions require thought
Announcements
Homework 2 due now.
Homework 3 is assigned today (see website).
Relations I
Ill try to post handouts before the lecture.
David L. Dill
Department of Computer Science
Stanford University
CS103
Spring 2017
Handout 12
April 14, 2017
Problem Set 2
This second problem set explores mathematical logic. We've chosen the questions here to help you
get a more nuanced understanding for what fir
CS 103 Homework 4 Solutions
Spring 2013-14
Problem 1
State, with the help of truth tables, whether the following statements in propositional logic are valid or not:
The truth tables for the statements
Department of Electrical Engineering and Computer Science
MASSACHUSETTS INSTITUTE OF TECHNOLOGY
6.830 Database Systems: Spring 2013 Quiz I
There are 13 questions and 13 pages in this quiz booklet. To
. . .CS103 HO#9 Proof Methods 4/9/10
1. How do we prove conditionals? The truth table for p q tells us that the conditional holds iff q can't be false when p is true. So what we can do is this, when w
1. Problem 1 (20 points)
This question is designed to get you used to the notation and mathematical conventions
surrounding sets. We strongly suggest working through this problem and doublechecking th
CS103
Fall 2014
Handout 12
October 12, 2014
Problem Set 3
This third problem set explores graph theory and mathematical logic. By the time you've finished it,
you'll have a much better feel for graphs
Department of Electrical Engineering and Computer Science
MASSACHUSETTS INSTITUTE OF TECHNOLOGY
6.814/6.830 Database Systems: Spring 2012 Quiz II
There are 18 questions and 14 pages in this quiz bookl
CS103 Midterm Exam October 27, 2009
I acknowledge and accept the Stanford University Honor Code:
Signature: _
NAME (print): _
1) You have 2.0 hours to complete this exam. 2) Do not include your scratc
CS 103 Homework 2 Solutions
Spring 2013-14
Problem 1
Nim is a family of games played by two players. The game is set up with several of piles of stones. Players
take turns removing stones from the pil
Homework 1
Due: Friday, April 12, 2013
CS 103 Spring 2012-2013
Notes
4/5/2013 3:10 PM We deleted an extra in problem 1, denition of Y .
These questions require thought, but do not require long answ
CS103
Fall 2015
Handout 12
October 2, 2015
Problem Set 2
This second problem set explores mathematical logic and provides more opportunities for you to
practice you proof techniques. We've chosen the
Handout #58 May 28, 2010
CS103 Robert Plummer
Practice Final
FINITE AUTOMATA 1. (5 points) Let L be the following language: L = cfw_ w | w cfw_0, 1* and the number of 0's in w is divisible by 2 and th
Homework 5
Due: Friday, May 10, 2013
CS 103, Spring 2012-2013
General Notes
These questions require thought, but do not require long answers. Please be
as concise as possible.
Please include your SU
Homework 6
Due: Friday, February 21, 2014
CS 103, Winter 2013-2014
These questions require thought, but do not require long answers. Please be as
concise as possible.
Please include your SUNet ID in
CS103
HO#54
Slides-More on Reductions
CS103
5/27/11
HALTTM = cfw_ M, w | Turing machine M halts on w
NOHALTTM = cfw_ M, w | Turing machine M does not halt on w
Mathematical Foundations of Computing
Handout #61 June 2, 2010
CS103 Robert Plummer
Practice Final Solutions
FINITE AUTOMATA 1. (5 points) Let L be the following language: L = cfw_ w | w cfw_0, 1* and the number of 0's in w is divisible b
CS103
Fall 2015
Handout 09
September 25, 2015
Problem Set 1
Here we are the first problem set of the quarter! This problem set is designed to give you practice
writing proofs on a variety of different
Announcements
Midterms will be returned at the end of this lecture.
Regular Languages V
David L. Dill
Department of Computer Science
Stanford University
2 / 22
1 / 22
Outline
Minimum DFA
One of the c
Outline
CS103 Introduction and Set Basics
Course Introduction and Overview
Purpose and Content
Course Administration
David L. Dill
Department of Computer Science
Stanford University
Sets
Basics
1 / 31
Announcements
Homework 3 due now.
Homework 4 is on the web.
Introduction to formal language theory
Practice midterm is on the web.
Dont forget the midterm Thursday evening.
David L. Dill
Departmen
Announcements
Cray Welcome Back Picnic with WICS on Friday afternoon! RSVP
by Wednesday. (Email sent.)
Functions
David L. Dill
Department of Computer Science
Stanford University
1 / 26
Outline
2 / 26
Announcements
Homework 1 is assigned today.
First problem session Monday evening.
First Order Logic
Keith Schwartzs course notes are on the web page.
David L. Dill
Department of Computer Science
Stanf
Announcements
Graded homeworks will be returned at the end of the lecture.
Turing Machines and Decidability III
David L. Dill
Department of Computer Science
Stanford University
2 / 24
1 / 24
Outline
Announcements
Homework due today.
Next homework is on the web.
Turing Machines and Decidability I
David L. Dill
Department of Computer Science
Stanford University
2 / 29
1 / 29
Outline
Turing machin
Announcements
HW8 assigned today.
HW8 will be due on the last day of class.
Turing Machines and Decidability IV
David L. Dill
Department of Computer Science
Stanford University
2 / 22
1 / 22
Outline