Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Decision Tree Learning
(a) Describe the main steps in the basic decision tree learning algorithm. The table below contains a sample S of ten examples. Each example is described using two Boolean attributes A and B. Each is labelled (classi ed) by the target Boolean function.
(b) What is the entropy of thse examples with respect to the given classi cation ?
[Note: you must show how you got your answer using the standard formula.] This table gives approximate values of entropy for frequencies of positive examples in a two-class sample.
(c) What is the information gain of attribute A on sample S above ?
(d) What is the information gain of attribute B on sample S above ?
(e) Which would be chosen as the \best" attribute by a decision tree learner using the information gain splitting criterion ? Why ?
(f) Describe a method for over tting-avoidance in decision tree learning.
Write an algorithm and design a flow chart to determine all people who have computer experience.
Write down the program which does the basic stack operations: Make the stack. Push element into the stack. Pop element from the stack.
A B+-tree is to be stored on disk whose block size is 2048 bytes. The data records to be stored are 50 bytes, and their key is 4 bytes. Determine the values for M and L for the B+-tree. Assume pointers are 4 bytes each.
The table given below gives portion of a linked list. Every list entry spans two consecutive address locations the 1st contains a letter of the alphabet, and 2nd contains a pointer to the next list entry.
Illustrate how edge connectivity of undirected graph G = (V, E) can be determined by running maximum-flow algorithm on at most |V| flow networks, each having O(V) vertices and O(E) edges.
Two CSMA/CD stations are each trying to transmit long documents. After each frame is sent, they contend for the channel using the binary exponential backoff algorithm.
Assume you are sitting at desk at office and using your laptop computer. The boss calls an emergency meeting for you and many colleagues, and asks everyone to bring his or her laptop computer.
Your network's traffic load is very high all times, day and night. What kind of switching do you configure switch to use?
Construct an entity-relationship (ER) model for the database. Make sure you include in your model details of entities, relationships, attributes, keys and limits in participation.
Suppose these names have the following hash values. Insert them into the extendible hash table shown below. Each leaf can only hold 4 entries.
Breakpoints between pi and p. Create greedy algorithm for Multiple Breakpoint Distance problem and estimate its approximation ratio.
Assume you have been assigned as manager on a assignment to develop a new application system for your business partner. You were given 2-weeks to construct a project plan and high level cost estimates.
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd