Quiz 2 - Chapter 2 - Sections 2.1 - 2.3
Due Jun 15 at 11:55pm Points 15 Questions 10 Available until Jun 15 at 11:55pm Time Limit 150 Minutes
This quiz was locked Jun 15 at 11 :55pm.
Attempt History
A
Quiz 3 - Chapter 2 - Sections 2.4 - 2.6
Due Jun 22 at 11:55pm Points 15 Questions 10 Available until Jun 22 at 11:55pm
Time Limit 150 Minutes
This quiz was locked Jun 22 at 11 :55pm.
Attempt History
A
6/14/2016 Quiz 0 - Terminology and Notes: COT3103: Discrete Computational Analysis (Online) 41323
Quiz 0 - Terminology and Notes
Due May 18 at 11:55pm Points 10 Questions 2 Available until May 18 at
Elliott Barnes
COT3103: Discrete Computational Analysis
41323 (Online)
Section 1.3 Exercises
10.
a)
p
q
p
pq
p (p q)
[p (p q)] q
T
T
F
F
T
F
T
F
F
F
T
T
T
T
T
F
F
F
T
F
T
T
T
T
16.
p
q
p
q
(p q)
(p q)
Elliott Barnes
COT3103: Discrete Computational Analysis
41323 (Online)
Section 2.1 Exercises
20. What is the cardinality of each of the sets?
a) = | = 0
b) cfw_ = |cfw_| = 1
c) cfw_, cfw_ = |cfw_, cfw
SECTION 2.1
Sets
20. The cardinality of a set is the number of elements it has.
a) The empty set has no elements, so its cardinality is 0 .
b) This set has one element (the empty set), so its cardinal
Elliott Barnes
COT3103: Discrete Computational Analysis
41323 (Online)
Section 1.1 Exercises
18.
a) T
b) T
c) F
d) T
32.
a)
p
T
F
b)
p
T
F
c)
p
T
T
F
F
p
p p
p
p p
q
pq
F
T
F
T
T
F
T
F
F
T
F
F
T
T
T
F
Mitchell Dawkins
6/20/17
COT3103
Chapter 3 Written Questions
1.
procedure largeSmall(a1,.,an : Integers)
answer = 0
smallest = ai
largest = ai
for i := 2 to n
if ai > largest
largest := ai
if ai < sma
Mitchell Dawkins
6/20/17
COT3103
Chapter 3 Written Questions
1.
procedure largeSmall(a1,.,an : Integers)
answer = 0
smallest = ai
largest = ai
for i := 2 to n
if ai > largest
largest :=
1. (4 pts) Consider all bit strings of length 12.
a) How many begin with 110?
b) How many begin with 11 and end with 10?
c) How many begin with 11 or end with 10?
d) How many have exactly four 1s?
2.
Section 1.1
1. (4 points) Construct a truth table for each of these compound propositions.
a) (pq) (pq)
b) (pq)(pq)
Section 1.2
2. (4 points) Let p be it is cold and let q be it is raining. Translate
Section 2.2
Section Summary
Set Operations
Union
Intersection
Complementation
Difference
More on Set Cardinality
Set Identities
Proving Identities
Membership Tables
Boolean Algebra
Propositi
Section 2.1
Section Summary
Definition of sets
Describing Sets
Roster Method
Set-Builder Notation
Some Important Sets in Mathematics
Empty Set and Universal Set
Subsets and Set Equality
Cardin
Section 2.6
Section Summary
Definition of a Matrix
Matrix Arithmetic
Transposes and Powers of Arithmetic
Zero-One matrices
Matrices
Matrices are useful discrete structures that can be used in man
Section 12.1
Section Summary
Introduction to Boolean Algebra
Boolean Expressions and Boolean Functions
Identities of Boolean Algebra
Duality
The Abstract Definition of a Boolean Algebra
Introduct
Section 1.2
Applications of Propositional Logic:
Summary
Translating English to Propositional Logic
System Specifications
Boolean Searching
Logic Puzzles
Logic Circuits
AI Diagnosis Method (Opti
Section 11.1
Section Summary
Introduction to Trees
Rooted Trees
Trees as Models
Properties of Trees
Trees
Definition: A tree is a connected undirected graph with no simple circuits.
Example: Which
Quiz 5 - Chapter 4 - Sections 4.1 - 4.2
Due Jun 29 at 11:55pm Points 10 Questions 10 Available until Jun 29 at 11:55pm
Time Limit 90 Minutes
This quiz was locked Jun 29 at 11 :55pm.
Attempt History
At
Quiz 6 - Chapter 6 - Sections 6.1 - 6.4
Due Jul 13 at 11:55pm Points 20 Questions 10 Available until Jul 13 at 11:55pm
Time Limit 120 Minutes
This quiz was locked Jul 13 at 11 :55pm.
Attempt History
A
Section 1.1: 16, 30, 32 parts a - d, 44 a-b
16. Determine whether these biconditionals are true or false.
a) 2+2=4 if and only if 1+1=2.
True; both statements are true.
b) 1+1=2 if and only if 2+3=4.