Jacob Lowey
Question 1 [Rosen Section 1.1, Exercise 30] ( points)
How many rows appear in a truth table for each of these compound propositions?
(a) (q p) (p q) 4 rows
(b) (p t) (p s) 8 rows
(c) (p r)
Jacob Lowey
Question 1 [Rosen Section 1.3, Exercise 42]
Suppose that a truth table in n propositional variables is specified. Show that a compound
proposition with this truth table can be formed by ta
CSCI 2200: Foundations of Computer Science
Homework 3 (100 points)
Due Friday, Feb. 24, 2017 at 11:59pm, in Gradescope
Homework submission and formatting requirements
Submissions not meeting the follo
CSCI 2200: Foundations of Computer Science
Homework 8 (100 points)
Due Wednesday, May 3, 2017 at 11:59pm, in Gradescope
Homework submission and formatting requirements
Submissions not meeting the foll
CSCI 2200: Foundations of Computer Science
Homework 2 (100 points)
Due Thursday, Feb. 9, 2017 at 11:59pm, in Gradescope
Homework submission and formatting requirements
Submissions not meeting the foll
CSCI 2200: Foundations of Computer Science
Homework 4 (100 points)
Due Thursday March 9, 2017 at 11:59pm, in Gradescope
Homework submission and formatting requirements
Submissions not meeting the foll
CSCI 2200: Foundations of Computer Science
Homework 1 (100 points)
Due Thursday, Jan. 26 2017 at 11:59pm, in Gradescope
Homework submission and formatting requirements
Submissions not meeting the foll
CSCI 2200: Foundations of Computer Science
Homework 7 (100 points)
Due Friday, April 21, 2017 at 11:59pm, in Gradescope
Homework submission and formatting requirements
Submissions not meeting the foll
CSCI 2200: Foundations of Computer Science
Homework 6 (100 points)
Due Thursday, April 6, 2017 at 11:59pm, in Gradescope
Homework submission and formatting requirements
Submissions not meeting the fol
CSCI 2200: Foundations of Computer Science
Homework 5 (100 points)
Due Friday, March 24, 2017 at 11:59pm, in Gradescope
Homework submission and formatting requirements
Submissions not meeting the foll
7%) l5!
CSCI 2200 - Spring 2014
Exam 1
3
Name: _
Instructions:
0 You have 100 minutes to complete this exam. The exam is worth a total of 90 points.
0 Put away laptop computers and other electronic de
Yihao Huang
RIN: 661536870
1,
A)
(a (17) mod 4 1
(a mod 4 (17) mod 4) 1
(a 3) mod 4 1
a3
B)
a 17 mod 4
a3
C)
a 17(mod 4)
a (mod 4) 17 mod(4)
a (mod 4) 3
a 4k 3
k 0, a 3
Yihao Huang
RIN: 661536870
2, P
Vincent Cerati - 661191386
Foundations of Computer Science
Fall 2014
Homework 3
5)
Base Case: A 21 *21 grid.
This can clearly be filled in by a single L-tile, as the remaining 3 tiles are in
the shape
Vincent Cerati - 661191386
Foundations of Computer Science
Fall 2014
Homework 1
5)
a) x and y are irrational numbers. We know 2 is irrational, so x = 2. We can then set y = 2 2, though we
have not yet
Rachel Blacker
RIN: 661034719
CSCI 2200 | Spring 2016
FOCS Homework 6
Problem 1
Suppose you have 35 books (15 novels, 10 math books, and 10 computer science
books). Assume that all 35 books
Rachel Blacker
RIN: 661034719
CSCI 2200 | Spring 2016
FOCS Homework 4
Problem 1
Prove that for all 2, $ > & + 3. What happens for = 1 or = 0?
When = 1 the inequality is false.
1$ > 1& + 3
Vincent Cerati - 661191386
Foundations of Computer Science
Fall 2014
Homework 7
5) We can picture n summed in 1s. So if n = 4 we have 1, 1, 1, 1. We can then imagine that there are
k - 1 dividers betw
Vincent Cerati - 661191386
Foundations of Computer Science
Fall 2014
Homework 5
5)
a) By definition we know that a full rooted binary tree must always have an odd number of nodes, and
also only leaf a
Vincent Cerati - 661191386
Foundations of Computer Science
Fall 2014
Homework 9
5)
a)
We have n people: x1,x2,x3,xN.
Considering there are n hats, the probability of any person x i getting their hat b
Vincent Cerati - 661191386
Foundations of Computer Science
Fall 2014
Homework 6
5) We can prove there exists n >= 3 for n boys and n girls such that all matchings lead to stable
relationships. We can
Name:
CSCI 2200: Foundations of Computer Science
Homework 3
Due Monday, Feb. 23, 2014 at 10:00 am, in class
Section:
1. (20 points) Prove that for all positive real numbers x and y, (x + y)/2 = xy if
FoCS: Exam 2 Review Questions
1. (Rosen 2.4: prob. 15) Show that the sequence cfw_an is a solution of the recurrence relation
an = an1 + 2an2 + 2n 9 if
(a) an = 5 (1)n n + 2
(b) an = 7 2n n + 2
2. Fo
CSCI 2200: Foundations of Computer Science
Homework 1 Solution (100 points)
Due Thursday, Feb. 5 2014 at 10:00 am, in class
Homework must be typed.
1. (15 points) Using propositional logic, write a st
CSCI 2200 Foundations of Computer Science (FoCS)
Homework 5 (document version 1.0)
Overview
This homework is due by 11:59:59 PM on Tuesday, March 6, 2018.
This homework is to be completed individual
CSCI 2200 Foundations of Computer Science (FoCS)
Homework 4 (document version 1.0)
Overview
This homework is due by 11:59:59 PM on Saturday, February 24, 2018.
This homework is to be completed indiv
CSCI 2200 Foundations of Computer Science (FoCS)
Homework 1 (document version 1.0)
Overview
This homework is due by 11:59:59 PM on Friday, January 26, 2018.
This homework is to be completed individu
CSCI 2200 Foundations of Computer Science (FoCS)
Homework 2 (document version 1.0)
Overview
This homework is due by 11:59:59 PM on Friday, February 2, 2018.
This homework is to be completed individu
CSCI 2200 Foundations of Computer Science (FoCS)
Homework 3 (document version 1.0)
Overview
This homework is due by 11:59:59 PM on Friday, February 9, 2018.
This homework is to be completed individu