Artificial Intelligence - MCQs - 1
1. What is Artificial Intelligence?
A. Artificial Intelligence is a field that aims to make humans more intelligentB. Artificial Intelligence is a field that aims to improve the
securityC. Artificial Intelligence is a field that aims to develop intelligent machinesD. Artificial Intelligence is a field that aims to mine the data
Ans: C
2. Who is the inventor of Artificial Intelligence?
A. Geoffrey Hinton
B. Andrew Ng
C. John McCarthy
D. Jürgen Schmidhuber
Ans: C
3. Which of the following is the branch of Artificial Intelligence?
A. Machine Learning
B. Cyber forensics
C. Full-Stack Developer
D. Network Design
Ans: A
4. What is the goal of Artificial Intelligence?
A. To solve artificial problems
B. To extract scientific causes
C. To explain various sorts of intelligence
D. To solve real-world problems
Ans: C
5. Which of the following is an application of Artificial Intelligence?
A. It helps to exploit vulnerabilities to secure the firm
B. Language understanding and problem-solving (Text analytics and NLP)
C. Easy to create a website
D. It helps to deploy applications on the cloud
Ans: B
6. Which of the following is not the commonly used
programming language for Artificial Intelligence?
A. PerlB. JavaC. PROLOGD. LISP
Ans: A
7. Which of the following is not an application of
artificial intelligence?
A. Face recognition systemB. ChatbotsC. LIDARD. DBMS
Ans: D
8. Which of the following is an advantage of artificial
intelligence?
A. Reduces the time taken to solve the problemB. Helps in providing securityC. Have the ability to think hence makes the work easierD. All of the above
Ans: D
9. Which search method takes less memory?
A. Depth-First SearchB. Breadth-First searchC. Optimal searchD. Linear Search
Ans: A
10. A heuristic is a way of trying __________
A. To discover something or an idea embedded in a programB. To search and measure how far a node in a search tree seems to be from a goalC. To compare two nodes in a search tree to see if one is better than the other isD. All of the mentioned
Ans: D
11. A.M. Turing developed a technique for determining
whether a computer could or could not demonstrate the artificial Intelligence,
Presently, this technique is called __________
A. Turing TestB. AlgorithmC. Boolean AlgebraD. Logarithm
Ans: A
12. DARPA, the agency that has funded a great deal of
American Artificial Intelligence research, is part of the Department of __________
A. DefenseB. EnergyC. EducationD. Justice
Ans: A
13. Which of these schools was not among the early leaders
in Artificial Intelligence research?
A. Dartmouth UniversityB. Harvard UniversityC. Massachusetts Institute of TechnologyD. Stanford University
Ans: B
14. A certain Professor at the Stanford University
coined the word ‘artificial intelligence’ in 1956 at a conference held at
Dartmouth college. Can you name the Professor?
A. David LevyB. John McCarthyC. Joseph WeizenbaumD. Hans Berliner
Ans: B
15. The conference that launched the AI revolution in 1956
was held at?
A. DartmouthB. HarvardC. New YorkD. Stanford
Ans: A
16. What is a heuristic function?
A. A function to solve mathematical problemsB. A function which takes parameters of type string and returns an integer valueC. A function whose return type is nothingD. A function that maps from problem state descriptions to measures of desirability
Ans: D
17. A search algorithm takes _________ as an input and
returns ________ as an output.
A. Input, outputB. Problem, solutionC. Solution, problemD. Parameters, sequence of actions
Ans: B
18. The _______ is a touring problem in which each city must
be visited exactly once. The aim is to find the shortest tour.
A. Finding shortest path between a source and a destinationB. Travelling Salesman problemC. Map coloring problemD. Depth first search traversal on a given map represented as a graph
Ans: B
19. Which search method takes less memory?
A. Depth-First SearchB. Breadth-First searchC. Linear SearchD. Optimal search
Ans: A
20. Which search strategy is also called as blind search?
A. Uninformed searchB. Informed searchC. Simple reflex searchD. All of the mentioned
Ans: A
21. Which search is implemented with an empty
first-in-first-out queue?
A. Depth-first searchB. Breadth-first searchC. Bidirectional searchD. None of the mentioned
Ans: B
22. Which search implements stack operation for searching
the states?
A. Depth-limited searchB. Depth-first searchC. Breadth-first searchD. None of the mentioned
Ans: B
23. What is the other name of informed search strategy?
A. Simple searchB. Heuristic searchC. Online searchD. None of the mentioned
Ans: B
24. Which function will select the lowest expansion node
at first for evaluation?
A. Greedy best-first searchB. Best-first searchC. Depth-first searchD. None of the mentioned
Ans: B
25. _________________ are mathematical problems defined as
a set of objects whose state must satisfy a number of constraints or
limitations.
A. Constraints Satisfaction ProblemsB. Uninformed Search ProblemsC. Local Search ProblemsD. All of the mentioned
Ans: A
26. A heuristic is a way of trying ___________
A. To discover something or an idea embedded in a programB. To search and measure how far a node in a search tree seems to be from a goalC. To compare two nodes in a search tree to see if one is better than anotherD. All of the mentioned
Ans: D
27. A* algorithm is based on ___________
A. Breadth-First-SearchB. Depth-First –SearchC. Best-First-SearchD. Hill climbing
Ans: C
28. Uninformed search strategies are better than informed
search strategies.
A. TrueB. False
Ans: B
29. Best-First search can be implemented using the
following data structure
A. QueueB. StackC. Priority QueueD. Circular Queue
Ans: C
30. What is the evaluation function in A* approach?
A. Heuristic function
B. Path cost from start node to current nodeC. Path cost from start node to current node + Heuristic costD. Average of Path cost from start node to current node and Heuristic cost
Ans: C
.png)
