I will use 0b to refer to binary numbers: ex: 0b1 = 1, 0b10 = 2
0b100 = 4 and 0b11 = 3
4+3 = 7
convert 7 to binary and you get 111.
Hope this helps, and May the Force Be With You!
<span>-Jabba</span>
Answer: B. PDF
Explanation:
Portable Document Format (PDF) is such an important document that it is considered the international standard for information and document exchange. It is used for letters, resumes and even electronic contracts.
PDF was developed by Adobe to make it independent of the device or application it is being viewed on and combines layers of information into one layer thereby making it a flat document.
Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
Answer:
The answer is nearest-neighbor learning.
because nearest neighbor learning is classification algorithm.
It is used to identify the sample points that are separated into different classes and to predict that the new sample point belongs to which class.
it classify the new sample point based on the distance.
for example if there are two sample points say square and circle and we assume some center point initially for square and circle and all the other points are added to the either square or circle cluster based on the distance between sample point and center point.
while the goal of decision tree is to predict the value of the target variable by learning some rules that are inferred from the features.
In decision tree training data set is given and we need to predict output of the target variable.
Explanation:
