Reference no: EM13950222

Write and execute a program in the language of your choosing that solves the following problems. Submit source code and answers in the provided dropbox:

(1) generate a list of 10 random integer numbers between 1 and 100. generate a special random number called SUM between 100 and 200. The determine what subset of the 5 random numbers when added comes closest to SUM without exceeding it. A simple example with less than 6 numbers - 10,3,15,2,9 with SUM = 14 correct answer = is the subset 10,3

Notice you must try ALL subsets for this to be an ALGORITHM. No other algorithm exists. In what sense is this algorithm a 'search'.

(2) create a 2 dimensional array (10 by 10) that represents a maze: fill the maze with asterisks and then make a 'random' path of blanks from the lower left (0,0) element to the upper right (9,9) element. Create a maze running program that prints out the correct path. Your program should move square by square - if it finds and asterisk blocking its path, it searches the next adjacent square, etc. Submit 10 separate trials proving your program discovers the correct path. Each path MUST be random!

(3) Write a program that outputs all numbers of n digits or less that meet the following constraint: let the number be X and let the number of digits of the number be called n with each digit being d1,d2,..,dn. The d1**n + d2**n + .. + dn**n = X. For example : 371 meets this constraint because 3**3 + 7**3 + 1**3 = 371 ! But 11 does NOT meet the constraint because 1**2 + 1**2 does not equal 11. Test your code for N = 30

(4) Consider the addition problem below:

97426 PLAYS

8077 WELL

------- ---------

105503 BETTER

Notice that when a letter is substituted for a number (in version 2) then everything is consistent! Now solve the problem below:

DONALD where D = 5

GERALD

-------------

ROBERT

You may use a pencil and paper and show all work. To receive credit, you must present the solution in full and answer the following questions

(a) In what sense is this a state space search?

(b) what constrained your search from simply trying everything?

(1) read chapter 3 carefully and do the following problems: 3.14, 3.15 <--- these types of questions are midterm type THESE ARE UNGRADED AND THE ANSWERS ARE IN THIS FOLDER!

(2) Run weka and produce a decision tree for the WEATHER NOMINAL data - dump the decision tree in jpg format

DO not turn these in! Just do them.
-----------------------------
To use WEKA:

(1) activate weka

(2) under the WEKA GUI, select EXPLORER

(3) in Explorer select Classify - in the CHOOSE section, under decision trees, select j.48

(4) under the Preprocess TAB, under open file, select WEATHER NOMINAL this file should be in the Weka directory under DATA then hit START on the CLASSIFY menu in the lower left window you'll see am entry that says trees.j48 = select it and right click. Then select 'visualize tree' - you should see the decision tree.

Another example:

Bring up Weka and go to the EXPLORER Menu.

under OPEN FILE - navigate to the WEKA directory (on Windows, it's in C:Program Files/Weka/data

1. Select the IRIS dataset

After it loads, select the top tab CLASSIFY and select J.48 as the Algorithm you want.

Go head an run the classifier.

After it finishes classifying , you will see the results - to the far left, right click over the J.48 algorithm and select VISUALIZE TREE - this will show you the decision tree it created.

1. What is the depth first search order and the breadth first search order of the tree place in this weeks folder labeled "Tree.pdf". Your answer should be search type (DFS or BFS) and the numbers of the nodes in the order they are visited.

2. Implement the decision tree about car problem found in the Lesson USING CLIPS TO MAKE A RULE BASED SYSTEM at the end of this module. Submit source code and 5 test cases in the drop box provided.

3. Consider the "guess the number" problem discussed in class and the resulting decision trees. If I m thinking of a number between 1 and 7, draw ALL the decision trees that someone could use and circle the 'best' one - the tree with the LEAST questions in the form "is it less than or greater than number X". The tree with the LEAST questions is the SHALLOWEST.