1. In a binary tree what is the maximum number of children a node can have?
0
1
2 (*)
Any
2. If a node has both its siblings set to null this is called a:
Parent
Leaf (*)
Root
Branch
3. Non binary tree classes still have a left and right node property.
True
False (*)
4. The difference between a tree and a binary tree structure is:
A binary tree is restricted to a maximum of 2 siblings (*)
A binary tree is based around the notion of a root node
A non binary tree cannot be traversed
A non binary tree does not have leaf nodes
5. Information Entropy quantifies how much information there is in an event.
True (*)
False
6. If you know the outcome of an event 100% of the time how much entropy is contained within it?
0 (*)
0.25
0.5
1
7. In a decision tree, it doesn't matter which questions you start with.
True
False (*)
8. In the following tree what would be the result of a Post-Order Traversal?
123456
4275631 (*)
4217536
1243576
9. Which of the following is not a typical example of tree traversal?
Pre Order Traverasal
Post Order Traversal
In Order Traversal
Reverse Order Traversal (*)
10. In the following tree, what would be the result of a Pre-Order Traversal?
123456
4275631
4217536
1243576 (*)
11. Decision trees can only be created using ID3.
True
False (*)
12. Decision trees work better if they have more access to more data.
True (*)
False
13.
This is an example of a recursive method
int power(int a, int n)
{
int result = 1;
for(int i=0;i result *= a;
}
return result;
}
True
False (*)
14. If you create no base case in a recursive method then you will create:
A quicker method
A more efficient method
An infinite loop (*)
An iterative method
15. In recursion, a base case must be defined.
True (*)
False
2. The code below is an example of
void someorder(Node node)
{
if (node == null)
return;
System.out.print(node.data + " ");
printPreorder(node.left);
printPreorder(node.right);
}
Pre Order Traverasal (*)
Post Order Traversal
In Order Traversal
Reverse Order Traversal
4. C4.5 is the successor to ID3.
True (*)
False
5. ID3 is short for:
Interactive Dichotomiser 3
Intersectional Dichotomiser 3
Iterative Dichotomiser 3 (*)
Institutational Dichotomiser 3
7. Which would be the best structure to show a family tree diagram?
Binary Tree
Non Binary Tree (*)
9. Trees are very useful for representing hierarchical structures.
True (*)
False
12. Variance is:
How average of all data items
How far data is spread out (*)
The difference between the largest and smallest item
Measures the relationship between all items
13. Which method uses more memory before iterative and recursive?
Recursive (*)
Iterative
Spiral
No difference
15. Recurive methods can always be written as iterative methods.
True (*)
False
5. Tree traversal is:
The process of searching for only one node
When you wish to remove all leaf nodes in a binary tree
When you set the root node on a binary tree
The process of visting each node once in a abinary tree (*)
9. The first node on a tree is known as a:
Point
Crown
Top
Root (*)
14. Decision trees can only be represented using binary trees.
True
False (*)
6. A method making a call to itself is called:
Iteration
Conditional
Recursion (*)
Search
1. In the following tree what would be the result of a In-Order Traversal?
123456
4275631
4217536 (*)
1243576
8. Binary Trees are made up of a structure known as a:
Point
Intersect
Node (*)
Nodule
13. C4.5 is the successor to ID3.
True (*)
False
1. In a Node class the name of the links to the children are normally called:
Child1, Child2
Left, Right (*)
Sibling1, Sibling2
Top, Bottom
5. Which of the following has the greatest variance?
0,0,0,0
1,2,3,4
1,1,2,2,3,3
1,50,100,2000 (*)
NOTE : Yang mau copas atau repost kunci jawaban ini di persilahkan.asalkan memberikan sumber atau credit kepada website ini karena saya lelah berulang kali retry test sampe pegal coegggg :'( -MoenawarP
Tidak ada komentar:
Posting Komentar