Problem Set 2
Assigned: Feb. 9.
Due: Mar. 2.
Problem 1
Show the results of applying alpha-beta pruning to the following game tree. What is
the best move for MAX at the top level? (You may do the probl
Programming Assignment 2
Assigned: Feb. 23
Due: Mar. 30
Overview
In this assignment, you are to implement the Davis-Putnam algorithm and use it to
solve a simple form of an adventure game.
The puzzle
CS-GY 6613
HW 3
Spring 2016
E. K. Wong
Total points = 55
1. [15 points] Consider a variation of the 8-puzzle problem that consists of a 3 x 3 board with
eight numbered tiles and a blank space. A tile
Problem Set 1
Assigned: Jan. 26
Due: Feb. 9
Problem 1
Characterize each of the following activities in terms of the properties listed in AIMA
figure 2.6. In borderline cases, briefly (1 or 2 sentences
Programming Assignment 3
Assigned: Mar. 30
Due: Apr. 27
Overview
In this assignment, you are to take a set of snippets produced by a search engine, and
to cluster them by subject.
Input format
A sampl
CS 6613 / CS 4613
HW 4
Spring 2017
E. K. Wong
# Questions = 2. Total points = 40.
1. [20 points] The Minimax algorithm was applied to generate the game tree below for a twoplayer game. The utility val
CS 6613 / CS 4613
HW 2 (revised 2.27.2017)
Spring 2017
E. K. Wong
# Questions = 6. Total points = 115.
1. [30 points] Given the simplified road map of Romania in Figure 2 (on page 3), the goal is to
f
CS 6613 / CS 4613
HW 5
Spring 2017
E. K. Wong
# Questions = 5. Total points = 70.
1. [15 points] In the 6-queen problem, the goal is to place 6 queens on a 6 x 6 board such that no
pair of queens atta
CS 6613 / CS 4613
HW 6
Spring 2017
E. K. Wong
# Questions = 8. Total points = 120.
1. [20 points] Fill in the time and space complexities in terms of n (the number of logic symbols)
for the propositio
CS 6613 / CS 4613
HW 3
Spring 2017
E. K. Wong
# Questions = 4. Total points = 65
1. [15 points] Consider a variation of the 8-puzzle problem that consists of a 3 x 3 board with
eight numbered tiles an
Throughout the next few assignments, we will be working with a file system format which is specified
below. The file system is actually created in a number of files named fusedata.X and stored on an
e
Programming Assignment 1
Assigned: Jan. 26.
Due: Feb. 23.
Assignment
Write a program that solves the Post correspondence problem, as described
in Problem Set 1, using the following algorithm:
In the
Problem Set 5
Assigned: April 6
Due: April 20
Problem 1
Consider the following Bayesian network:
Assume that all the random variables are Boolean, and that you have the following
probabilities:
P(A=T)
Davis-Putnam (DPLL) procedure
Martin Davis and Hillary Putnam, 1961
dp(in
ATOMS : set of propositional atoms;
S : Set of propositional formulas in CNF)
return either a valuation on ATOMS satisfying S
Entropy
Consider the following problem. You have a alphabet of K dierent symbols and a collection C of strings of these symbols where each string has length N . To each string S C you want to assign a
Example of ID3 algorithm
The line numbers are for convenient reference: this is _not_ an attribute.
Also, of course, "Number of instances" is not an attribute.
Line number
1
2
3
4
5
6
7
8
9
10
11
12
P
Independent Evidence
The independence assumption can also be used in evidence combination. Suppose that we have two events E and F , both of which are evidence for another event X . If we can assume t
Linear Separators
Consider a classification problem of determining whether an instance X is a member
of one particular category C. That is, the classification attribute has two values T and
F.
Suppose
Minimum Description Length Learning
One approach to conceptualizing the problem of learning is in terms of the mimumum
description length (MDL) principle. Given a body of data D and a representation
l
Naive Bayes for Classifying Text
Naive Bayes
Suppose you have a collection of documents D1 . Dn labelled as belonging to
categories C1 . Ck. A new document D is given for you to categorize. In a
proba
Syntax of Predicate Calculus
The predicate calculus uses the following types of symbols:
Constants: A constant symbol denotes a particular entity. E.g. john, muriel
1.
Functions: A function symbol den
Problem Set 3
Assigned: March 2.
Due: March 23.
Problem 1
The VERTEX COVER problem is defined as follows. You are given:
An undirected graph.
A number K.
The problem is to find a subset S of the ver
Problem Set 4
Assigned: March 23
Due: April 6
Problem 1
Construct a resolution proof of sentence (F) from Problem set 3, Problem 3, sentences
A-E. You should show (a) the Skolemized form of the axioms
Clustering Algorithms
Decompositional (top-down)
Agglomerative (bottom-up)
Any decompositional clustering algorithm can be made hierarchical by recursive
application.
K-means algorithm
K-means-cluste