MALLAREDDY ENGINEERING COLLEGE (AUTONOMOUS)

M.TECH I YEAR I Semester (MR 22, 2023-24Batch) II- Mid Question Bank
(Objective)

Subject Code and Name: Machine Learning( C5105) Branch/ Specialization: CSE/(CSE)

Name of the Faculty: Mr. K V VARAPRASAD

s.no Questions Ans

1. What if the target function is real valued in kNN algo?
A. Calculate the mean of the k nearest neighbours
B. Calculate the SD of the k nearest neighbour
C. None of these
D. Both A & B
2. What is/are true about Distance-weighted KNN?
A. The weight of the neighbour is considered
B. The distance of the neighbour is considered
C. Both A & B N
D. one of these
3. What is/are advantage(s) of Locally Weighted Regression?
A. Pointwise approximation of complex target function
B. Earlier data has no influence on the new ones
C. Both A & B
D. None of these
4. The quality of the result depends on (LWR)
A. Choice of the function
B. Choice of the kernel function K
C. Choice of the hypothesis space H
D. one of these
5. PNN/GRNN networks have one neuron for each point in the training file, While
RBF network have a variable number of neurons that is usually
A. less than the number of training
B. greater than the number of training points
C. qual to the number of training points
D. None of these
6. What is/are true about RBF network?
A. A kind of supervised learning
B. Design of NN as curve fitting problem .
C. Use of multidimensional surface to interpolate the test data
D. All of these
7. Application of CBR
A. Design
B. lanning
C. Diagnosis
D. All of these
8. What is/are advantages of CBR?
 A. A local approx. is found for each test case
B. Knowledge is in a form understandable to human
C. Fast to train
D. All of these
9. Genetic algorithm is a
A. Search technique used in computing to find true or approximate solution to
optimization and search problem
B. Sorting technique used in computing to find true or approximate solution to
optimization and sort problem
C. . Both A & B
D. None of these
10. The algorithm operates by iteratively updating a pool of hypotheses, called the
A. Population
B. Fitness
C. None of these
D. Both A & B
11. What is the correct representation of GA?
A. GA(Fitness, Fitness_threshold, p)
B. GA(Fitness, Fitness_threshold, p, r )
C. GA(Fitness, Fitness_threshold, p, r, m)
D. GA(Fitness, Fitness_threshold)
12. Search through the hypothesis space cannot be characterized. Why?
A. Hypotheses are created by crossover and mutation operators that allow
radical changes between successive generations
B. Hypotheses are not created by crossover and mutation
C. None of these
D. Both A & B
13. What are the area CLT comprised of?
A. Sample Complexity
B. Computational Complexity
C. Mistake Bound
D. All of these
14. How large is the hypothesis space when we have n Boolean attributes?
A. |H| = 3 ^n
B. |H| = 2^ n
C. |H| = 1 ^n
D. |H| = 4^n
15. For a particular learning task, if the requirement of error parameter changes from
0.1 to 0.01. How many more samples will be required for PAC learning?
A. Same
B. 2 times
C. 1000 times
D. 10 times
16. What is/are the requirement for the Learn-One-Rule method?
A. Input, accepts a set of +ve and -ve training examples.
B. Output, delivers a single rule that covers many +ve examples and few -ve.
C. Output rule has a high accuracy but not necessarily a high
D. A, B & C
17. Ground literal is a literal that
 A. Contains only variables
B. does not contains any functions
C. does not contains any variables
D. Contains only functions Answer
18. emphasizes learning feedback that evaluates the learner’s performance without
providing standards of correctness in the form of behavioural
A. Reinforcement learning
B. Supervised Learning
C. None of these
D. Both A & B
19. Features of Reinforcement learning
A. Set of problem rather than set of techniques
B. RL is training by reward and
C. RL is learning from trial and error with the .
D. All of these
20. Which type of feedback used by RL?
A. Purely Instructive feedback
B. Purely Evaluative feedback
C. Both A & B
D. None of these
21. What is/are the problem solving methods for RL?
A. Dynamic programming
B. Monte Carlo Methods
C. Temporal-difference learning
D. All of these
22. The hypothesis space has a general-to-specific ordering of hypotheses, and the
search can be efficiently organized by taking advantage of a naturally occurring
structure over the hypothesis space
A. TRUE
B. FALSE
C. PartiallyTrue
D. Partially False
23. The Version space is:
A. The subset of all hypotheses is called the version space with respect to the
hyothesis space H and the training examples D, because it contains all
plausible versions of the target
B. The version space consists of only specific
C. None of these
D. Both A & B
24. The Candidate-Elimination Algorithm
A. The key idea in the Candidate-Elimination algorithm is to output a
description of the set of all hypotheses consistent with the training
B. Candidate-Elimination algorithm computes the description of this set
without explicitly enumerating all of its
C. This is accomplished by using the more-general-than partial ordering and
maintaining a compact representation of the set of consistent
D. All of these
25. The hypothesis h1 is more-general-than hypothesis h2 ( h1 > h2) if and only if
h1≥h2 is true and h2≥h1 is false. We also say h2 is more-specific-than h1
 A. The statement is true
B. The statement is false
C. We cannot
D. None of these
26. PAC stands for
A. Probability Approximately Correct
B. Probability Applied Correctly
C. Partition Approximately Correct
D. None of these
27. A radial basis function is a
A. Activation function
B. Weight
C. Learning rate
D. none
28. Which of the following sentence is FALSE regarding reinforcement learning
A. It relates inputs to
B. It is used for .
C. It may be used for
D. It discovers causal relationships.
29. Suppose the reinforcement learning player was greedy, that is, it always played the
move that brought it to the position that it rated the best. Might it learn to play
better, or worse, than a non greedy player?
A. Worse
B. Better
C. Good
D. Bad
30. A chess agent trained by using Reinforcement Learning can be trained by playing
against a copy of the same
A. TRUE
B. False
C. PartiallyTrue
D. Partially False
31. Expectation–maximization (EM) algorithm is an
A. Iterative
B. Incremental
C. None
D. We cannot

32. A computer program that learns to

A. play checkers might improve its performance as Measured by its ability
to win at the class of tasks involving playing checkers
B. Experience obtained by playing games against
C. Both a & b
D. None of these
33. A subset of machine learning that involves systems that think and learn like
humans using artificial neural networks.
A. Artificial Intelligence
 B. Machine Learning
C. Deep Learning
D. All of these
34. dog('Buddy', likes('Buddy', toast)). - This statement is
A. Rules and Horn clause
B. Fact and Horn clause
C. Horn clauses with head and body
D. Not a Horn clause
35. Which one from the options would return true/yes for given prolog program?
boy(john,123).girl(jane,234). student(john,123).
A. ?-girl(jane,x)
B. ?-boy(john,123)
C. All of these
D. None of these
36. Which one of the following is not a variable?
A. X_yz
B. g_23A
C. _Xyz'
D. both B & C
37. A prolog query can be made up of only two subgoals.
A. TRUE
B. False
C. PartiallyTrue
D. Partially False
38. Which combines inductive methods with the power of first-order representations?
A. Inductive programming
B. Logic programming
C. Inductive logic programming
D. Lisp programming
39. Which cannot be represented by a set of attributes?
A. Program
B. Three-dimensional configuration of a protein molecule
C. Agents
D. None of the mentioned
40. Which is an appropriate language for describing the relationships?
A. First-order logic
B. Propositional logic
C. ILP
D. None of the mentioned
41. Which produces hypotheses that are easy to read for humans?
A. ILP
B. Artificial intelligence
C. Propositional logic
D. First-order logic
42. What need to be satisfied in inductive logic programming?
A. Constraint
B. Entailment constraint
C. Both Constraint & Entailment constraint
D. None of the mentioned
43. Which method can’t be used for expressing relational knowledge?
A. Literal system
B. Variable-based system
C. Attribute-based system
D. None of the mentioned
44. Which approach is used for refining a very general rule through ILP?
A. Top-down approach
B. Bottom-up approach
C. Both Top-down & Bottom-up approach
D. None of the mentioned
45. Which of the given language is not commonly used for AI?
A. LISP
B. PROLOG
C. Python
D. Perl
46. First order logic Statements contains______. .
A. Predicate and Preposition
B. Subject and an Object
C. Predicate and Subject
D. None of the above
47. In LISP, the addition of 5+8 is entered as_______.
A. 5+8
B. 5 add 8
C. 5+8=
D. (+5 8)
48. The calculation of earned values depends on
A. Activity type
B. Actual cost
C. Economy growth
D. cumulative cost
49. Budjet cost related of work in the earned value management related to the schedule
is defined by
A. Planed value
B. performance index
C. schelude performance index
D. Earned value
50. In the earned value analysis,the amount of work performed duringa given period
isdefined through
A. Planed value
B. Earned value
C. Budjet completion
D. Estimate at completion
51. In the earned value management,total cost of all activities can be calculated by
A. Estimate at completion
B. Budjet at completion
C. Cost performance
D. cost varience
52. Which of the following standard algorithms is not Dynamic Programming based.
 A. Bellman–Ford Algorithm for single source shortest path.
B. Floyd Warshall Algorithm for all pairs shortest paths
C. Prim's Spanning Tree
D. Prim's Minimum Spanning Tree
53. Kadane algorithm is used to find:
A. Maximum sum subsequence in an array
B. aximum sum subarray in an array
C. Maximum product subsequence in an array
D. aximum product subarray in an array
54. Consider two strings A = "qpqrr" and B = "pqprqrp". Let x be the length of the
longest common subsequence (not necessarily contiguous) between A and B and
let y be the number of such longest common subsequences between A and B. Then
x + 10y = ___.
A. 33
B. 23
C. 43
D. 34
55. Let A1, A2, A3, and A4 be four matrices of dimensions 10 x 5, 5 x 20, 20 x 10,
and 10 x 5, respectively. The minimum number of scalar multiplications required
to find the product A1A2A3A4 using the basic matrix multiplication method is
A. 1500
B. 2000
C. 500
D. 100
56. Consider a sequence F00 defined as : F00(0) = 1, F00(1) = 1 F00(n) = 10 ∗ F00(n
– 1) + 100 F00(n – 2) for n ≥ 2,Then what shall be tha set of values of the
sqequence FOO
A. (1, 110, 1200)
B. (1, 110, 600, 1200)
C. (1, 2, 55, 110, 600, 1200)
D. (1, 55, 110, 600, 1200)
57. What happens when a top-down approach of dynamic programming is applied to
any problem?
A. It increases both, the time complexity and the space complexity
B. It increases the space complexity and decreases the time complexity.
C. It increases the time complexity and decreases the space complexity
D. It decreases both, the time complexity and the space complexity
58. If an optimal solution can be created for a problem by constructing optimal
solutions for its subproblems, the problem possesses ____________ property.
A. Overlapping subproblems
B. Optimal substructure
C. Memoization
D. Greedy
59. If a problem can be solved by combining optimal solutions to non-overlapping
problems, the strategy is called _____________
A. Dynamic programming
B. Greedy
C. Divide and conquer
 D. Recursion
60. A greedy algorithm can be used to solve all the dynamic programming problems.
A. TRUE
B. FALSE
C. Partially False
D. Partially True
61. When a top-down approach of dynamic programming is applied to a problem, it
usually _____________
A. Decreases both, the time complexity and the space complexity
B. Decreases the time complexity and increases the space complexity
C. Increases the time complexity and decreases the space complexity
D. Increases both, the time complexity and the space complexity
62. Which of the following problems is NOT solved using dynamic programming?
A. 0/1 knapsack problem
B. Matrix chain multiplication problem
C. Edit distance problem
D. Fractional knapsack problem
63. Temporal difference learning is an online learning method.
A. TRUE
B. FALSE
C. Partially False
D. Partially True
64. Q-learning: Using an optimal exploration function leads to no regret while learning
the optimal policy
A. TRUE
B. FALSE
C. Partially False
D. Partially True

65. A small discount (close to 0) encourages greedy behavior.

A. TRUE
B. FALSE
C. Partially False
D. Partially True
66. A large, negative living reward (_ 0) encourages greedy behavior.
A. TRUE
B. FALSE
C. Partially True
D. Partially False
67. A negative living reward can always be expressed using a discount < 1
A. TRUE
B. FALSE
C. Partially True
D. Partially False
68. A discount < 1 can always be expressed as a negative living reward.
A. TRUE
B. FALSE
C. Partially False
 D. Partially True
69. Perceptron is an algorithm for supervised classification
A. TRUE
B. FALSE
C. Partially True
D. Partially False
70. Instance based learning algorithm cannot be referred as Lazy learning algorithm
A. TRUE
B. FALSE
C. Partially False
D. Partially True
71. Which of the following feature need to be specify to well define the learning
problem
A. A class of task
B. Measure of performance to be improved
C. Measure of performance to be improved
D. All of these
72. The type of traning experience available can have significant impact on success or
failure of learning.
A. TRUE
B. FALSE
C. Partially False
D. Partially True
73. Which of the factors affect performance of learner system does not include
A. Traning senario
B. Representation scheme used
C. Good data structures
D. Type of feed back

74. How to solve a overfitting of a problem

A. By gathering more data for "traning data"
B. Reduce the noise level
C. By selecting one with fewer parameters .
D. All of these
75. Which of the following problems should be solved using dynamic programming?

A. Mergesort
B. Binary search
C. Longest common subsequence
D. Quicksort
Signature of the Faculty HOD-CSE