CIS 300 Foundations of Computer Science

1. Schedule

Foundations of Computer Science, Reading
Last day to Add/Drop is Friday 2024-01-26
- <2024-01-22 Mon>
  - What is a "Foundation"?
    - What are the Foundations of Computer Science?
  - How will this course proceed?
  - Assignment: hHowToReadABook.pdf (on the reading of How to Read A Book, v5.0)
- <2024-01-23 Tue>
  - Group Work: gPogil
- <2024-01-24 Wed>
  - Read CDMCS 2.2
  - Numbers
  - Divides
  - Modulus
  - Assignment: Lodder, deductionThroughTheAges.pdf Questions 1.1, 1.2
- <2024-01-26 Fri>
  Last day of Add-Drop
  - Read: Edwards, How to Read A Book, v5.0
  - Watch: The Study Cycle
  - Study Quiz
  - How to Read a Book
  - How to Study
  - Due: hHowToReadABook.pdf
  - Assignment: hSumAndNumbers
Logic: Deduction Through the Ages
- <2024-01-29 Mon>
  - Read: Lodder, deductionThroughTheAges.pdf Sections 1 - 3
  - Quiz
  - Syllogism
  - The Five Indemonstrable Forms
  - Due: Lodder, deductionThroughTheAges.pdf Questions 1.1, 1.2
  - Assignment: Lodder, deductionThroughTheAges.pdf Question 4.1
- <2024-01-30 Tue>
  - Group Work: gTheFiveIndemonstrableForms
- <2024-01-31 Wed>
  - Read: Lodder, deductionThroughTheAges.pdf Section 4
  - Quiz
  - Boole's Algebra
  - Due: Lodder, deductionThroughTheAges.pdf Question 4.1
  - Due: hSumAndNumbers
  - Assignment: Lodder, deductionThroughTheAges.pdf Questions 5.1, 5.2
- <2024-02-02 Fri>
  - Read: Lodder, deductionThroughTheAges.pdf Section 5
  - Frege's Concept Script
  - What is a true implication?
  - Due: Lodder, deductionThroughTheAges.pdf Questions 5.1, 5.2
  - Assignment: Lodder, deductionThroughTheAges.pdf Questions 3.1/6.1 (comparing notations)
Deduction Through the Ages: Modern Era
- <2024-02-05 Mon>
  - Read: Lodder, deductionThroughTheAges.pdf Section 6
  - Russell and Whitehead's Principia
  - Due: Lodder, deductionThroughTheAges.pdf Questions 3.1/6.1
  - Assignment: Lodder, deductionThroughTheAges.pdf Questions 7.1, 7.4, 7.5
- <2024-02-06 Tue>
  - Read: Lodder, deductionThroughTheAges.pdf Section 7
  - Quiz
  - Wittgenstein
  - Due: Lodder, deductionThroughTheAges.pdf Questions 7.1, 7.4, 7.5
  - Assignment: Lodder, deductionThroughTheAges.pdf Questions 8.1, 8.2
- <2024-02-07 Wed>
  - Read: Lodder, deductionThroughTheAges.pdf Section 8
  - Quiz
  - Post
  - Due: Lodder, deductionThroughTheAges.pdf Questions 8.1, 8.2
- <2024-02-09 Fri>
  - Group Work: gDeductionThroughTheAges
Logic in the Modern Notation
- <2024-02-12 Mon>
  - Read: CDMCS 3.1-3.3
  - Modern Truth Tables
  - Implication: inverse, converse, contrapositive
  - Homework: hLogic
- <2024-02-13 Tue>
  - Group Work: gLogicalEquivalence
- <2024-02-14 Wed>
  - Read: CDMCS 3.4
  - Quiz
  - Predicate Logic
  - Quantification
- <2024-02-16 Fri>
  - Defining Predicates
  - Using Predicates
  - Quantification
    - ∀ versus ∃
Exam, Basic Types, Winter Recess
- <2024-02-19 Mon>
  - Read: CDMCS 2.3
  - Read/Do: Introduction to Sets
  - Sets
  - Set Operations: ∩, ∪, compliment
  - Due: hLogic
- <2024-02-20 Tue>
  - x001 - Exam: Logic, Implication, Predicates
- <2024-02-21 Wed>
  - Set Notations
  - Subsets
  - Members
  - Power Sets
  - Homework: hSets
- <2024-02-23 Fri>
  - [Break]
Cardinality — How big is it?
- <2024-02-26 Mon>
  - Read: CDMCS 2.4
  - Series and Sequence
  - Alphabets, Strings, Languages
  - Assigned: aLearningScientists
- <2024-02-27 Tue>
  - Group Work: gSets
- <2024-02-28 Wed>
  - Quiz: {0, 1}*
  - Cardinality of Sets
  - Finite
  - Countably Infinite
- <2024-03-01 Fri>
  - Read: CDMCS 2.5
  - Listen: The Learning Scientists' Podcast Student's Use of Spaced and Retrieval Practice [~16:32]
  - Listen: The Learning Scientists' Podcast Student's Use of Other Study Practices [~20:52]
  - Learning
  - Due: hSets
Proofs
- <2024-03-04 Mon>
  - To Infinity and Beyond!
  - Uncountable Infinities
  - Hilbert's Hotels
- <2024-03-05 Tue>
  - Group Work: gPowerSetsAndCardinality
- <2024-03-06 Wed>
  - Prove countable({Integers})
- <2024-03-08 Fri>
  - How many even numbers are there?
  - How many primes?

Exam, Proofs
- <2024-03-11 Mon>
  - Are all integers countable?
- <2024-03-12 Tue>
  - x002 - Exam: Sets/Set Builder; Functions; Cardinality; Inference
- <2024-03-13 Wed>
  - Read: Lodder, PascalsTriangleAndInduction.pdf up to the 1st Consequence, p.4
  - First look at Pascal's triangle
- <2024-03-15 Fri>
  - Read: CDMCS 4.3
  - Valid inference
  - Direct Proof
  - Due: hSetsFunctionsReview
Pascal's Triangle and Mathematical Induction
Last day to Withdraw or Elect S/U 2024-03-29
- <2024-03-18 Mon>
  - Read: CDMCS 4.4, 4.5
  - Quiz
  - Proof by Contradiction
  - Proof by Contraposition
- <2024-03-19 Tue>
  - Group Work: gProofs
- <2024-03-20 Wed>
  - Read: Lodder, PascalsTriangleAndInduction.pdf until the 5th Consequence, p. 6
  - Read: CDMCS as discussed in question 2, p.6, in Lodder.
  - Pascal's triangle: features
- <2024-03-22 Fri>
  - Assignment: Lodder, PascalsTriangleAndInduction.pdf to the end.
  - Pascal's Twelfth Conjecture
  - Practical uses of Pascal's triangle
Induction
Last day to Withdraw or Elect S/U 2024-03-29
- <2024-03-25 Mon>
  - Read: CDMCS 5.1-5.2
  - Proof by Induction
- <2024-03-26 Tue>
  - Group Work: gPascalsTriangle
- <2024-03-27 Wed>
  - Read: CDMCS 5.3
  - Strong induction
  - Breaking chocolate bars
  - The Fundamental Theorem of Arithmetic
- <2024-03-29 Fri>
  - Setting up proofs: strong/weak induction
  - Induction, recurrence, and recursion
Spring Recess
- <2024-04-01 Mon>
  [Break]
- <2024-04-02 Tue>
  [Break]
- <2024-04-03 Wed>
  [Break]
- <2024-04-05 Fri>
  [Break]
Exam, Deciders, Counting
- <2024-04-08 Mon>
  - Binary language redux
  - Deciders
- <2024-04-09 Tue>
  - x003 - Exam: Proof Techniques, Induction, Pascal's Triangle
- <2024-04-10 Wed>
  - Watch: Metacognition is the Key
  - Studying
- <2024-04-12 Fri>
  Last day to Withdraw, Elect S/U
  - Pigeon Hole principle
  - Counting deciders
Halting Problem
- <2024-04-15 Mon>
  - Defining the Halting Problem
  - What does it mean?
- <2024-04-16 Tue>
  - Group Work: gHaltingDeciding
- <2024-04-17 Wed>
  - More on Proof by Counting
- <2024-04-19 Fri>
  - Recurrence Relations
Diagonalization
- <2024-04-22 Mon>
  - Self-reference
  - Russell's paradox
  - Halting Problem: undecidable
- <2024-04-23 Tue>
  - Group Work: gDiagonalization
- <2024-04-24 Wed>
  - An undecidable language
  - Proof by Construction
  - How many binary strings |{0,1}*|
  - How many binary languages |ℙ({0,1}*)|
  - Proof by Counting and Contradiction
  - |{0,1}*| =? |ℙ({0,1}*)|
- <2024-04-26 Fri>
  - Diagonalization
  - Due: hDiagonalization
Return to Recurrence Relations
- <2024-04-29 Mon>
  - Closed forms
  - Hanoi's running time
- <2024-04-30 Tue>
  - Group Work: gRecurrences
- <2024-05-01 Wed>
  - Closed forms by expansion
  - Proving closed forms
- <2024-05-03 Fri>
  - Practice
Proofs with Recurrences
- <2024-02-06 Tue>
  - More Closed forms
- <2024-05-07 Tue>
  - Group Work: gMoreRecurrences
- <2024-05-08 Wed>
  - What have we learned?
- <2024-05-10 Fri>
  - Questions/Review
Final Exam
- <2024-05-15 Wed 08:00>–<2024-05-15 Wed 10:00>

2. Dr. Ladd's Weekly Schedule

	Monday	Tuesday	Wednesday	Friday
0800	CIS 300 Foundations	CIS 300 Foundations	CIS 300 Foundations	CIS 300 Foundations	0800
0900	Office	Office	Office	Office	0900
1000	CIS 205 CS III	Office	CIS 205 CS III	CIS 205 CS III	1000
1100	CIS 356 Computer Org	CIS 356 Computer Org	CIS 356 Computer Org	CIS 356 Computer Org	1100
1200	Office			Office	1200
1300	Office			Department Meeting	1300
1400					1400
1500					1500

3. Dr. Ladd's Exam Schedule

	Monday	Tuesday	Wednesday	Thursday	Friday
	20240513	20240514	20240515	20240516	20240517
0800			CIS 300 Foundations			0800
1015	CIS 205 CS III					1015
1230	CIS 356 Computer Org					1230
1445						1445