Artificial Intelligence
Welcome to NTA NET ASPIRANT ACADEMY
NTA NET ASPIRANT ACADEMY is a training academy for College Lectures, Assistant Professor, Research Scholar and PG Students to make qualified for Assistant Professor & JRF in UGC NET / TNSET
NTA NET ASPIRANT ACADEMY is a training academy for College Lectures, Assistant Professor, Research Scholar and PG Students to make qualified for Assistant Professor & JRF in UGC NET / TNSET
Start
Congratulations - you have completed Artificial Intelligence.
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 1 |
Which of the following statements are true? NTA NET JUNE 2020
A. Minimax search is breadth first; it processes all the nodes at a level before moving to a node in next level.
B. The effectiveness of the alpha - beta pruning is highly dependent on the order in which the states are examined.
C. The alpha - beta search algorithm computes the same optimal moves as minimax algorithm.
D. Optimal play in games of imperfact information does not require reasoning about the current and future belief states of each player
Choose the correct answer from the options given below:
A. Minimax search is breadth first; it processes all the nodes at a level before moving to a node in next level.
B. The effectiveness of the alpha - beta pruning is highly dependent on the order in which the states are examined.
C. The alpha - beta search algorithm computes the same optimal moves as minimax algorithm.
D. Optimal play in games of imperfact information does not require reasoning about the current and future belief states of each player
Choose the correct answer from the options given below:
A | (A) and (C) only |
B | (A) and (D) only |
C | (B) and (C) only |
D | (C) and (D) only |
Question 2 |
Given below are two statements: NTA NET JUNE 2020
If two variables V1 and V2 are used for clustering, then consider the following statements for K means clustering with K=3:-
Statement I: If V1 and V2 have correlation of 1 the cluster centroid will be in straight line.
Statement II: If V1 and V2 have correlation of 0 the cluster centroid will be in straight line.
In the light of above statements, choose the correct answers from the options given below:
If two variables V1 and V2 are used for clustering, then consider the following statements for K means clustering with K=3:-
Statement I: If V1 and V2 have correlation of 1 the cluster centroid will be in straight line.
Statement II: If V1 and V2 have correlation of 0 the cluster centroid will be in straight line.
In the light of above statements, choose the correct answers from the options given below:
A | Both Statement I and Statement II are true. |
B | Both Statement I and Statement II are false. |
C | Statement I is true but Statement II is false. |
D | Statement I is false but Statement II is true. |
Question 3 |
Given below are two statements: NTA NET JUNE 2020
Statement I: A genetic algorithm is a stochastic hill - climbing search in which a large population of states is maintained.
Statement II: In nondeterministic environments, agents can apply AND - OR search to generate contingent plans that reach the goal regardless of which outcomes occur during execution.
In the light of the above statements, choose the correct answer from the options given below:
Statement I: A genetic algorithm is a stochastic hill - climbing search in which a large population of states is maintained.
Statement II: In nondeterministic environments, agents can apply AND - OR search to generate contingent plans that reach the goal regardless of which outcomes occur during execution.
In the light of the above statements, choose the correct answer from the options given below:
A | Both Statement I and Statement II are true. |
B | Both Statement I and Statement II are false. |
C | Statement I is true but Statement II is false. |
D | Statement I is false but Statement II is true. |
Question 4 |
Which of the following is NOT true in problem solving in artificial intelligence? NTA NET JUNE 2020
A | Implements heuristic search technique |
B | Solutions steps are not explicit |
C | Knowledge is imprecise |
D | It works on or implements repetition mechanism |
Question 5 |
Match List I with List II
List - I | List - II |
---|---|
A. Branch and Bound | (i) Keeps track of all partial paths which can be candidate for further exploration |
B. Steepest - accent hill climbing | (ii) Detects difference between current state and goal state |
C. Constraint satisfaction | (iii) Discovers problem state(s) that satisfy a set of constraints |
D. Means-end-analysis | (iv) Considers all moves from current state and selects best move |
A | A- i, B - iv, C - iii, D - ii |
B | A- i, B - ii, C - iii, D - iv |
C | A- ii, B - i, C - iii, D - iv |
D | A- ii, B - iv, C - iii, D - i |
Question 6 |
Match List I with List II NTA NET JUNE 2020
Choose the correct answer from the options given below:
List - I | List - II |
---|---|
A. Greedy Best - first search | (i) Space complexity is O(d) where d=depth of the deepest optimal solution |
B. A* | (ii) Incomplete even if the search space is finite. |
C. Recursive Best - first search | (iii) Optimal if optimal solution is reachable; otherwise, returns the beat reachable optimal solution. |
D. SMA* | (iv) Computation and space complexity is too high |
A | A - ii, B - iv, C - i, D - iii |
B | A - ii, B - iii, C - i, D - iv |
C | A - iii, B - ii, C - iv, D - i |
D | A - iii, B - iv, C - ii, D - i |
Question 7 |
Consider the following: NTA NET DECEMBER 2019
A. Trapping at local Maxima
B. Reaching a plateau
C. Traversal along the ridge.
Which of the following option represents shortcomings of the hill climbing algorithm?
A. Trapping at local Maxima
B. Reaching a plateau
C. Traversal along the ridge.
Which of the following option represents shortcomings of the hill climbing algorithm?
A | (A) and (B) only |
B | (A) and (C) only |
C | (B) and (C) only |
D | (A),(B) and (C) only |
Question 8 |
Consider the following learning algorithms: NTA NET DECEMBER 2019
A. Logistic regression
B. Support Vector Machine (SVM)
C. Linear regression
Which of the following option represents classification algorithms?
A. Logistic regression
B. Support Vector Machine (SVM)
C. Linear regression
Which of the following option represents classification algorithms?
A | (A) and (B) only |
B | (A) and (C) only |
C | (B) and (C) only |
D | (A), (B) and (C) only |
Question 9 |
In Artificial Intelligence (AI), an environment is uncertain if it is _______. CBSE NET JULY 2018
A | Not fully observable and not deterministic |
B | Not fully observable or not deterministic |
C | fully observable but not deterministic |
D | Not fully observable but deterministic |
Question 10 |
In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of _____. CBSE NET JULY 2018
A | Current percept, Completely ignoring rest of the percept history. |
B | rest of the percept history, completely ignoring current percept. |
C | both current percept and complete percept history |
D | both current percept and just previous percept |
Question 11 |
In heuristic search algorithms in Artificial Intelligence(AI), if a collection of admissible heuristics h1.....hm is available for a problem and none of them dominates any of the others, which should we choose? CBSE NET JULY 2018
A | h(n) = max{h1(n),......,hm(n)} |
B | h(n) = min{h1(n),......,hm(n)} |
C | h(n) = avg{h1(n),......,hm(n)} |
D | h(n) = sum{h1(n),......,hm(n)} |
Question 12 |
Consider the following sentences regarding A*, an informed search strategy in Artificial Intelligence (AI). CBSE NET JULY 2018
(A) A* expands all nodes with f(n)*.
(B) A* expands no nodes with f(n)≥C*.
(C) Pruning is integral to A*.
Here, C* is the cost of the optimal solution path.
Which of the following is correct with respect to the above statements?
(A) A* expands all nodes with f(n)
(B) A* expands no nodes with f(n)≥C*.
(C) Pruning is integral to A*.
Here, C* is the cost of the optimal solution path.
Which of the following is correct with respect to the above statements?
A | Both Statement (A) and Statement (B) are true |
B | Both Statement (A) and Statement (C) are true |
C | Both Statement (B) and Statement (C) are true |
D | All the statements (A), (B) and (C) are true. |
Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
Get Results
There are 12 questions to complete.
You have completed
questions
question
Your score is
Correct
Wrong
Partial-Credit
You have not finished your quiz. If you leave this page, your progress will be lost.
Correct Answer
You Selected
Not Attempted
Final Score on Quiz
Attempted Questions Correct
Attempted Questions Wrong
Questions Not Attempted
Total Questions on Quiz
Question Details
Results
Date
Score
Hint
Time allowed
minutes
seconds
Time used
Answer Choice(s) Selected
Question Text
All done
Need more practice!
Keep trying!
Not bad!
Good work!
Perfect!