Program III - Market Basket Analysis
10 points Due: 16-Apr-2008
Problem Statement
MiJac, Inc. is a large power tools company specializing in the sale of woodworking power tools and accessories. They have recently deployed a website to support on-lin
Sets
Introduction
Sets are an important mathematical data structure
Naturally occurring Theoretically described Powerful notation
Definition
An unordered collection of distinct objects that share one or more common property
Unordered means
3/5/2008
Dynamic Programming
Definition
Divide the problem into a tree of sub-problems Conquer each problem in the tree in post-order, recording problem/solution pairs in a table Combine the solution to each child problem to solve each parent pr
Combinatorics
Introduction
Combinatorics is the study of the arrangement of discrete objects Who Cares?
Counting is important whenever we have finite resources Examples:
Words of memory needed to store . Instructions needed to solve . Number
CS 250 Quiz Key
5 points Open Book/Open Notes Name: _ Given matrices with the following dimensions: A1 is (10 x 4) A2 is (4 x 5) A3 is (5 x 20) A4 is (20 x 2) Find the optimal factorization for this example. Be sure to complete both of the following
Class: CS 250 Professor: Michael R. Wick Textbook: Mathematical Structures for Computer Science: A Modern Treatment of Discrete Structures
(5th Edition). J. Gersting, W.H. Freeman and Company: New York , NY . 2003.
Homework I Key
Due: 30-Jan-2008
p.
Homework V Key Due: 14-Mar-2008
Textbook: Mathematical Structures for Computer Science: A Modern Treatment of Discrete Structures
(5th Edition).
J. Gersting, W.H. Freeman and Company: New York , NY . 2003.
Page 178, #3 Five: {2,3,4} {a,b,c} {a,b,e}
Homework II Key
Due: 13-Feb-2008
Textbook: Mathematical Structures for Computer Science: A Modern Treatment of Discrete Structures
(5th Edition).
J. Gersting, W.H. Freeman and Company: New York , NY . 2003.
p.57
#7
1. 2. 3. 4. 5. 6. hyp hyp 1, ei
Homework III Key Due: 22-Feb-2008
Textbook: Mathematical Structures for Computer Science: A Modern Treatment of Discrete Structures
(5th Edition).
J. Gersting, W.H. Freeman and Company: New York, NY . 2003.
Problem #12, page 140
F(n) = F(n-2) + F(n
Practice Problems on Sets Key
Textbook: Mathematical Structures for Computer Science: A Modern Treatment of Discrete Structures
(5th Edition).
J. Gersting, W.H. Freeman and Company: New York , NY . 2003.
Page 179, #9 a) 2 b) 2 c) 1 d) 3 e) 3
Page
Program II - Optimal Image Matching
10 points Due: 28-Mar-2008
Stereovision is an area of image processing in which images from two distinct cameras are "overlayed" to produce a 3D representation of the scene. One approach to stereovision is to use a
Program I - Resolution Theorem Prover
10 points Due: 12-Feb-2008
Resolution is a powerful rule of inference. In its simplest form, a resolution theorem prover follows a relatively straightforward algorithm as shown below. State the postulated theorem
Relations
Definitions & Notation
A binary relation from A to B is a subset of A x B A binary relation on A is a subset of A x A A binary relation is defined by
Enumerating elements Relations definition: x r y x + y is odd
Binary relations ca