MIDTERM: CS 6375 INSTRUCTOR: VIBHAV GOGATE October, 23 2013 The exam is closed book. You are allowed a one-page cheat sheet. Answer the questions in the spaces provided on the question sheets. If you run out of room for an answer, use an additional sheet (available from the instructor) and staple it to your exam. • NAME • UTD-ID if known • SECTION 1: • SECTION 2: • SECTION 3: • SECTION 4: • SECTION 5: • Out of 90: 1 CS 6375 FALL 2013 Midterm, Page 2 of 13 October
Words: 2270 - Pages: 10
Section 9.1 Exercise 2 The graph is not a tree, because there more than one paths from one vertex to another. Exercise 3 The graph is not a tree, because not all of the vertices of the graph are connected. Thus, there is no an existing unique path between some vertices. Exercise 9 The height of the tree in the Exercise 8 is 4 Exercise 10 [pic] The height of this tree is 5 Exercise 12 An example of the hierarchical relationship is a family tree: [pic] Section 9.2 Exercise 5 Siblings
Words: 374 - Pages: 2
It was a warm, cloudy, winter day in Gordon, Wisconsin. The trees were leafless and brown, with the exception of the pine trees which had all their green needles still hanging on to the tree. Julianne, Anja and their dog Flynn were going out to their fort by the river that flowed behind their house. Julianne Huesby was a thirteen-year-old girl. She was tall, slim and blond. She also had a kind personality and was not quick to anger. Anja Huesby, Julianne’s sister, was also tall and blond.
Words: 1074 - Pages: 5
Let’s suppose the prediction for the sales demand that Ann Queen derived from other comparable events is accurate. It is relatively easy to figure out the possible DVDs that can be sold with expected probability if we draw a decision tree. From the above tree graph, we can tell that the total possibility to sell 4000 DVDs in Saturday and Sunday is 25%. If Ann Queen’s expectation about the possibility of DVD sold is accurate and nothing new information will be available after Friday’s and Saturday’s
Words: 555 - Pages: 3
#NAME? 15.0% 0 #NAME? #NAME? Depression Don't Test #NAME? -$40,000,000.00 Indications #NAME? #NAME? 0 #NAME? #NAME? Test Effective #NAME? -$150,000,000.00 #NAME? 75.0% -100,000,000 #NAME? #NAME? Test Merck Decision Tree Although a decision analysis would recommend that Merck not commit to the proposal, the company's balance sheet shows that it has significant assets to support a loss. The projected values of earning for depression and dual indications seem to be worth
Words: 354 - Pages: 2
which could be either ITALIAN or FRENCH. Define an algorithm for dealing with missing attributes and partially specified attributes,which includes the modified calculation for information gain use to make splitting decisions. Generate a decision tree for this example using your new algorithm. Answer There are a lot of ways of answering this question. One algorithm is as follows: For a training instance with multivalued attributes, I will duplicate that instance by the number of values of that
Words: 456 - Pages: 2
HW3 – Due 02/14/2015,11:55PM on Moodle Please submit your answers in Moodle as one Word file, named HW3_FirstnameLastname.docx, that includes the complete solution to these problems, including your decision tree and final conclusions about the recommended decision. Please also post the corresponding Excel file that contains the decision trees to these problems, one per worksheet, clearly labeled with the problem number. TOTAL: 100 points 1. The NC Airport Authority is trying to solve a difficult
Words: 455 - Pages: 2
The Giving Tree was published in October 7, 1964. This book is fifty-three years old. The Giving Tree is about a boy who goes to the tree very often when he was young and when he gets older he goes to the tree less often. Every time the boy went to the tree he always asked for something and the tree gave the boy something always and always shared stuff while the boy did not. In the Giving Tree, Shel Silverstein uses personification to show that to give is more than to receive. Tree is personified
Words: 627 - Pages: 3
COSC5315 Group Project due: November 25/26, 2014 Exploration of Grammar/Acceptor/Language Applications Task: This is a group project for which up to four people can work together. Your task is to write a report of no more than seven pages on application of Grammars or Acceptors or Languages of any type or types, 0, 1, 2, or 3. One such application is a design of a CFG for an abbreviated version of java illustrated by the following java program. Your report must be well organized with
Words: 543 - Pages: 3
Assignment: Binary Search Tree + Heap = Treap October 10, 2012 Binary search tree, as shown in figure 1, is a binary tree data structure which is used to hold key-value pairs and satisfies following properties; • The left subtree of any node contains only those nodes with keys less than the node’s key. • The right subtree of any node contains only those nodes with keys greater than the node’s key. key=10 val="AU" key=8 val="BN" key=15 val="TN" key=12 val="NZ" key=17 val="DL" key=19
Words: 1803 - Pages: 8
