Guys... i cannot understand that Decision Tree shcematic, and the Hashing Algorithms
if anybody could do a summery in pretty simple words... thanks in advance !
MIT 6.00 Intro Computer Science (OCW)
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
Also called a Random Forest.
can you put your finger on the thing that is giving you the most trouble?
the decision tree i saw was a graphic way of representing the process of choosing items for the 0/1 knapsack problem. For every item there are two decisions - take it or not. the tree explores both possibilities and the consequences of each. each item is a node in the tree/graph, the act of taking it or not each creates a branch to the next item in the list which itself has two branches which lead to the next item which .......
maybe watch it a few times and try it yourself with pen(cil) and paper
ther is a wikipedia article that might help
there are also a few you tube videos for decision tree