A.
B.
C.
D.
Option: C
|
A.
B.
C.
D.
Option: C
A. Self Organization
B. Adaptive Learning
C. Fault tolerance
D. Robustness
Option: B
A. Pattern Recognition
B. Classification
C. Clustering
D. All of these
Option: D
A. A class of learning algorithms that try to derive a Prolog program from examples
B. A table with n independent attributes can be seen as an n- dimensional space.
C. A prediction made using an extremely simple method, such as always predicting the same output.
D. None of these
Option: C
A. Additional acquaintance used by a learning algorithm to facilitate the learning process
B. A neural network that makes use of a hidden layer
C. It is a form of automatic learning.
D. None of these
Option: A
A. back face removal
B. depth buffer method
C. scan line method
D. depth sort method
Option: A
A. fluorescence
B. persistence
C. phosphorescence
D. incandescence
Option: B
A. Latin
B. German
C. French
D. Arabic
Option: A
A. Q
B. R
C. S
D. P
Option: B
A. cavalier, cabinet, isometric
B. cavalier, cabinet
C. isometric, dimetric, trimetric
D. isometric, cavalier, trimetric
Option: C
A. back face removal
B. depth buffer method
C. scan line method
D. depth sort method
Option: A
A. Additional acquaintance used by a learning algorithm to facilitate the learning process
B. A neural network that makes use of a hidden layer
C. It is a form of automatic learning.
D. None of these
Option: A
A. A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
B. Any mechanism employed by a learning system to constrain the search space of a hypothesis
C. An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
D. None of these
Option: A
A. win.txt
B. win.std
C. win.main
D. none of these
Option: A
A. fluorescence
B. persistence
C. phosphorescence
D. incandescence
Option: B