CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #3
Due Date: Sunday, September 21
Suggested Reading: Rosen Sections 1.7 - 1.8, 2.1; Lehman et al. Chapter 1 and 4.1
These are the problems that you need to turn in. For more practic
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #4
Due Date: Tuesday, Sept 30
Suggested Reading: Rosen Sections 2.2 - 2.3; Lehman et al. Chapter 4.1, 4.3, 4.4
These are the problems that you need to turn in. For more practice, yo
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment Solution #6
Due Date: Sunday, Oct 19
Suggested Reading: Rosen Section 5.2 - 5.3; Lehman et al. Chapter 5
These are the problems that you need to turn in. For more practice, you are
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #4
Due Date: Tuesday, Sept 30
Suggested Reading: Rosen Sections 2.2 - 2.3; Lehman et al. Chapter 4.1, 4.3, 4.4
These are the problems that you need to turn in. For more practice, yo
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #3
Due Date: Sunday, Sept 21
Suggested Reading: Rosen Sections 1.4 - 1.6; Lehman et al. Chapter 3
These are the problems that you need to turn in. For more practice, you are encoura
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #6
Due Date: Sunday, Oct 19
Suggested Reading: Rosen Section 5.2 - 5.3; Lehman et al. Chapter 5
These are the problems that you need to turn in. For more practice, you are encourage
COM S 330 Homework 14 Ryan Brink & Devin Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
A * means the problem is slightly harder than the others.
Problem 1. [10pts] A forest is a graph that
COM S 330 Homework 09 Devin Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Problem 1. [10pts] Let S R be defined recursively using (Basis Step) 2015 S, (Constructive Step) if
x, y S, then x
COM S 330 Homework 08 Devin Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Problem 1. [10pts] Let M = (S, T, s0 ) be the state machine where S = N N and the transitions in T are
given as (m,
COM S 330 Homework 04 Devin L Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Problem 1. [5pts] Give a direct proof of the following statement: If x and y are rational numbers, then
x + y and
COM S 330 Homework 05 Devin Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Problem 1. [5pts] Consider our definitions of Z, Q, R, and C. Recall that A B means A is a subset of
B and A 6 B me
COM S 330 Homework 02 Devin L Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Problem 1. [5pts] Construct a truth table for the compound proposition (p q) (p r).
pqr
FFF
FFT
FTF
FTT
TFF
TFT
T
COM S 330 Homework 07 Devin Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Problem 1. [5pts] Consider the sequence cfw_An
n=0 where each element of the sequence is a set An , defined
by A0
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #1
Due Date: Friday, September 5
Suggested Reading: Rosen Sections 1.1 - 1.3; Lehman et al. Sections 1.1, 3.1 - 3.4
These are the problems that you need to hand in for grading. For
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #2
Due Date: Friday, Sept 12
Suggested Reading: Rosen Sections 1.4 - 1.6; Lehman et al. Chapter 3
These are the problems that you need to turn in. For more practice, you are encoura
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #8
Due Date: Sunday, Nov 2
Suggested Reading: Rosen 9.1 and 9.5, LLM 9.4
These are the problems that you need to turn in. For more practice, you are encouraged to
work on the other
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #7
Due Date: Sunday, Oct 26
Suggested Reading: Rosen Section 5.3; LLM Chapter 6.1 - 6.3
These are the problems that you need to turn in. For more practice, you are encouraged to
wor
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #9
Due Date: Tuesday, Nov 11
Suggested Reading: Rosen Section 2.5; LLM Chapter 7.1
These are the problems that you need to turn in. For more practice, you are encouraged to
work on
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #2
Due Date: Friday, Sept 12
Suggested Reading: Rosen Sections 1.4 - 1.6; Lehman et al. Chapter 3
These are the problems that you need to turn in. For more practice, you are encoura
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #5
Due Date: Sunday, Oct 12
Suggested Reading: Rosen Section 5.1 - 5.2; Lehman et al. Chapter 5.1 - 5.3
These are the problems that you need to turn in. For more practice, you are e
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment #1 Solutions
Due Date: Friday, September 5
Suggested Reading: Rosen Sections 1.1 - 1.3; Lehman et al. Sections 1.1, 3.1 - 3.4
These are the problems that you need to hand in for gra
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment Solutions#5
Due Date: Sunday, Oct 12
Suggested Reading: Rosen Section 5.1 - 5.2; Lehman et al. Chapter 5.1 - 5.3
These are the problems that you need to turn in. For more practice,
CS 330 : Discrete Computational Structures
Fall Semester, 2014
Assignment Solutions #7
Due Date: Sunday, Oct 26
Suggested Reading: Rosen Section 5.3; LLM Chapter 6.1 - 6.3
These are the problems that you need to turn in. For more practice, you are encoura
COM S 330 Homework 10 Devin Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Pt
Problem 1. [10pts] Let n1 , . . . , nt be positive integers. Prove that if 1 + i=1 ni objects are placed into t
COM S 330 Homework 06 Devin Lyle Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Problem 1. [10pts] Consider the following sequence definitions. Write out the first 10 terms (n cfw_0, . . . ,
COM S 330 Homework 01 Devin L Johnson
Type your answers to the following questions and submit a PDF file to Blackboard. Use only one page per
problem.
Problem 1. [5pts] Describe your previous mathematical experience, including most recent math courses
and
HW2 - ComS 330 - SPRING 2016
Due Date - Friday, February 12
GRADING RULE FOR THE SPRING SESSION:
Only about 50-60% of problems in each assignment will be graded!
The choice of problems to be graded will be made after due date.
Solutions to all problems wi
HW1 - ComS 330 - SPRING 2016
Due Date - Friday, January 22?
GRADING RULE FOR THE SPRING SESSION:
Only about 50-60% of problems in each assignment will be graded!
The choice of problems to be graded will be made after due date.
Solutions to all problems wi
HW4 - ComS 330 - SPRING 2016
Due Date - Friday, February 26
GRADING RULE FOR THE SPRING SESSION:
Only about 50-60% of problems in each assignment will be graded!
The choice of problems to be graded will be made after due date.
Solutions to all problems wi
HW2 - ComS 330 - SPRING 2016
Due Date - Friday, February 12
GRADING RULE FOR THE SPRING SESSION:
Only about 50-60% of problems in each assignment will be graded!
The choice of problems to be graded will be made after due date.
Solutions to all problems wi