logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Complete the decision tree ADT The Decision Tree (DT) ADT is of the following format.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

The Diabetic society has hired you to design a system that helps them predict the likelihood of someone having a heart attack based on their medical history. Your supervisor created a decision tree (DT) specifying how to predict a person’s risk of having a heart attack. image He left you with these instructions: Complete the decision tree ADT Generate the decision tree (DT) based on the image given. Complete the recursive program that predicts a person’s risk level based on their medical history. .

1. Complete the decision tree ADT The Decision Tree (DT) ADT is of the following format. A tuple that contains a DT string in the first index position and list in the second index position containing the root, left subtree and right subtree in that order. The decision tree ADT has the following function def make_empty_tree(root): def makeTree(root, left, right): def root(DT): def left_subtree(DT): def right_subtree(DT): def is_empty(DT):

def is_DT(DT): A DT is considered empty if both subtrees are empty lists. ("DT", [ root, [], [] ]) – empty DT .

2. Generate the decision tree (DT) based on the image given. Generate the decision tree (DT) using the ADT constructors. The tree shouldbe called . .

3. Complete the recursive program that predicts a person’s risk level based on their medical history Complete the recursive function that predicts a person’s risk level based on their medical history. The function accepts a tree and patient history as a list of 7 strings of "True" or "False". A person’s history is given in the following format. History = HGC,DB,HBP,DBF,EH,SM,BMI where each value is a string "True" or "False" Found High Glucose - HGC Diabetic - DB High Blood Pressure - HBP Diabetic Family - DBF Excess Hunger - EH Smoke - SM Body Max Index - BMI The program receives historical record of a patient in the order specified. E.g. history = [True,True,True,True,False,True,False] means that the following are known for that patient HGC = True, DB = True, HBP = True, DBF = True, EH = False, SM = True, BMI = False Based on the tree and patient history received, the function returns the patient's risk level as a 3-character string "LRL", "MRL" or "HRL", representing Low Risk Level, Moderate Risk Level or High Risk Level respectively. Low Risk Level - LRL Moderate Risk Level - MRL High Risk Level – HRL Input Format "True" "True" "True" "True" "False" "True" "False" Note that these are strings! Constraints None Output Format String with one of the following: Low Risk Level – LRL, Moderate Risk Level – MRL or High Risk Level – HRL Sample Input 0 True True True True False True False Sample Output 0 HRL Explanation 0 HGC = True DB = True HBP = True DBF = True EH = False SM = True BMI = False Based on the DT if someone has high glucose levels and they are Diabetic they are at a high risk of heart attack. (HRL) Sample Input 1 False False True True False True False Sample Output 1 MRL Explanation 1 HGC = False DB = False HBP = True DBF = True EH = False SM = True BMI = False Based on the DT if someone has low glucose levels but their blood pressure is high and their family has a history of diabetes but their BMI is less than 25 they have a moderate risk level (MRL)

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

838 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

550 Answers

Hire Me
expert
Husnain SaeedComputer science

519 Answers

Hire Me
expert
Atharva PatilComputer science

852 Answers

Hire Me
April
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30