see image 3. Consider the following dataset representing whether one plays tennis ornot based on various weather related obser vations,Outlo okSunnySunnyTemp. Humidity Wind PlayHighHighHighHighHotFalseYesHotTrueNoOvercastHotFalseYesRainyRainyRainyOvercast CoolMildFalseYesCoolNormalFalseYesCoolNormalTrueNoNormalTrueYesFalseSunnySunnyRainySunnyMildHighNormalNoCoolFalseYesMildNormalFalseYesMildNormalTrueYesOvercastMildHighTrueYesOvercastHotNormalFalseYesRainyMildHighTrueNoUsing only entropy as the node splitting criteria, how large a tree (totalnumber of nodes) would be required. Count all nodes where a split ismade. Leaf nodes should not be counted. (a) 6, (b) 5, (c) 7, (d) 8, (e)None of these choices.

Answered: Image /qna-images/answer/10c7a78a-446d-4f1a-a6ce-1c2c1ce4e699.jpg

3. Consider the following dataset representing whether one plays tennis or not based on various weather related obser vations, Outlo ok Temp. Humidity Wind Play High High High High Normal Sunny Hot False Yes Sunny Hot True No Overcast Hot Mild False Yes Rainy Rainy Rainy Overcast Cool False Yes Cool False Yes Cool Normal True No Normal True Yes Mild Sunny Sunny Rainy Sunny High Normal False No Cool False Yes Mild Normal False Yes Mild Normal True Yes High Normal Overcast Mild True Yes Overcast Hot False Yes

3. Consider the following dataset representing whether one plays tennis or not based on various weather related obser vations, Outlo ok Temp. Humidity Wind Play High High High High Normal Sunny Hot False Yes Sunny Hot True No Overcast Hot Mild False Yes Rainy Rainy Rainy Overcast Cool False Yes Cool False Yes Cool Normal True No Normal True Yes Mild Sunny Sunny Rainy Sunny High Normal False No Cool False Yes Mild Normal False Yes Mild Normal True Yes High Normal Overcast Mild True Yes Overcast Hot False Yes

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

THIS IS MY CODE HELP ME ACHIEVE POINTS OUTLINED BELOW : #include <stdio.h>#include <stdlib.h>#include <string.h>#include <float.h>#include "graph.h"#include "dijkstra.h" #define INFINITY DBL_MAX /* find shortest paths between source node id and all other nodes in graph. *//* upon success, returns an array containing a table of shortest paths. *//* return NULL if *graph is uninitialised or an error occurs. *//* each entry of the table array should be a Path *//* structure containing the path information for the shortest path between *//* the source node and every node in the graph. If no path exists to a *//* particular desination node, then next should be set to -1 and weight *//* to DBL_MAX in the Path structure for this node */Path *dijkstra(Graph *graph, int id, int *pnEntries){ int n; int i, j; int* nv = get_vertices(graph, &n); int *S = malloc(n * sizeof(int)); double *D = malloc(n * sizeof(double)); int *R = malloc(n…
Suppose that the height of a Binary Search Tree is ℎ, then the time complexty to delete a node in the BST will be ?(ℎ). True or false Please explain why
Given the following key sequence (6,22,9,14,13,1,8) build the dynamic binary search tree WITHOUT BALANCING IT. How many probes (i.e., comparisons) does it take to determine that key 100 is not in the tree? (In this study case, the root is 6; the next element 22 > 6, so it goes to the right, etc). DEPTH counting starts at 1 at the root
In order to send a request to the master replica of a data item, a node must know which replicais the master for that data item. a. Suppose that between the time the node identifies whichnode is the master replica for a data item, and the time the request reaches the identifiednode, the mastership has changed, and a different node is now the master. How can such asituation be dealt with?
Suppose that instead of each node x keeping the attribute x.p, pointing to x’s parent, it keeps x.succ, pointing to x’s successor. Give pseudocode for SEARCH, INSERT, DELETE, and EDIT routine on a binary search tree T using this representation. These procedures should operate in time O(h), where h is the height of the tree T. (Hint: You may wish to implement a subroutine that returns the parent of a node.) Show these types of pseudocode using java. Data structures and algorithms
Answer the following questions about treeB. a. What is the height of the tree? b. Which nodes are on level 3? c. Which levels have the maximum number of nodes that they could contain? d. What is the maximum height of a binary search tree containing these nodes? Draw such a tree. e. What is the minimum height of a binary search tree containing these nodes? Draw such a tree. f. What is the order in which the nodes are visited by an ignorer traversal? g. What is the order in which the nodes are visited by a preorder traversal? h. What is the order in which the nodes are visited by a postorder traversal?
Let's pretend you have access to a list of x, y coordinates and the names of local eateries. Take into account just the following categories of inquiries: The inquiry seeks to ascertain whether a dining establishment may be located at a given address. Is it preferable to use an R-tree or a B-tree index? Why?
Suppose that a B+-tree index on (dept_name, building) is available on relationdepartment. What would be the best way to handle the following selection?σ(building < “Watson”) ∧ (budget < 55000) ∧ (dept name = “Music”)(department)
Given a binary search tree and data of two nodes, find 'LCA' (Lowest Common Ancestor) of the given two nodes in the BST.LCALCA of two nodes A and B is the lowest or deepest node which has both A and B as its descendants. Example:In this example, the green coloured node is the LCA to A and B.Alt TextNote:It is defined that each node is a descendant to itself, so, if there are two nodes X and Y and X has a direct connection from Y, then Y is the lowest common ancestor.Example:Alt TextNote:1. If out of 2 nodes only one node is present, return that node. 2. If both are not present, return -1.3. all the node data will be unique.Input format:The first line of input contains data of the nodes of the tree in level order form. The data of the nodes of the tree is separated by space. If any node does not have left or right child, take -1 in its place. Since -1 is used as an indication whether the left or right nodes exist, therefore, it will not be a part of the data of any node.The following…
Write a program that will undertake a range search of all elements lying within limits a, b along a dimension i of the multidimensional data set, representedas a k-d tree. For example, given the data set {(7, 5), (4, 2), (6, 8), (1, 4), (3, 5), (2, 4), (3, 7),(9, 1), (6, 6), (5, 1)} represented as a k-d tree (k = 2), a range search of data elements lying within (a = 3, b = 7) along dimension i = 2 yields {(7, 5), (1, 4), (3, 5), (3, 7), (6, 6)}.
a) Explain with a suitable example why B+ Trees are considered as balanced?b) Consider a B Tree used as an index that has THREE levels including the root node. If a newkey is inserted in this index, then what shall be the maximum number of nodes? Explain youranswer with an example.c) Clustering index is defined on the ordered fields but not Keys, why? Explain with example.d) How performance suffers due to poor indexing? Explain using Example.
Write a program that will undertake a range search of all elements lying within limits a, b along a dimension i of the multidimensional data set, represented as a k-d tree. For example, given the data set {(7, 5), (4, 2), (6, 8), (1, 4), (3, 5), (2, 4), (3, 7), (9, 1), (6, 6), (5, 1)} represented as a k-d tree (k = 2), a range search of data elements lying within (a = 3, b = 7) along dimension i = 2 yields {(7, 5), (1, 4), (3, 5), (3, 7), (6, 6)}