0% found this document useful (0 votes)
12 views

Ai MCQ

Uploaded by

patilvinit114
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views

Ai MCQ

Uploaded by

patilvinit114
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Module 3: Search Algorithms Terminology

1. What is a brute force search strategy?


A) A search using heuristic guidance
B) An exhaustive search without any guidance
C) A search that prunes unnecessary paths
D) A random search approach

2. Which algorithm explores nodes level-by-level?


A) Depth First Search
B) Breadth First Search
C) Binary Search
D) Random Search

3. What is the main characteristic of Depth First Search (DFS)?


A) It uses a queue
B) It explores as far as possible along a branch before backtracking
C) It’s guided by a heuristic
D) It only works with sorted data

4. Breadth First Search (BFS) is optimal if:


A) The search space is infinite
B) All path costs are the same
C) It is implemented using a stack
D) It is combined with a heuristic

5. Which of the following is a heuristic search strategy?


A) DFS
B) BFS
C) A* Algorithm
D) Linear Search

6. Local search algorithms are best suited for:


A) Problems with a small search space
B) Problems with well-defined end points
C) Problems with no global view required
D) All types of problems

7. In a local search algorithm, which of the following is used to avoid getting stuck in
local optima?
A) Greedy algorithm
B) Breadth-first traversal
C) Simulated Annealing
D) Depth-first traversal

8. Which data structure is commonly used for implementing BFS?


A) Stack
B) Queue
C) Tree
D) List

9. In heuristic searches, a heuristic function is used to:


A) Measure the cost of reaching the goal
B) Randomly select the next node
C) Provide an estimate of the path cost
D) Ensure optimality

10. Which algorithm is not a type of local search algorithm?


A) Hill Climbing
B) Tabu Search
C) DFS
D) Genetic Algorithm
Module 4: Fuzzy Logic Systems
11. What does a fuzzy logic system primarily handle?
A) Exact binary data
B) Incomplete data
C) Degrees of truth
D) Random data

12. In fuzzy logic, the function that defines how each point in the input space is mapped
to a membership value is called:
A) Defuzzification
B) Fuzzification
C) Membership Function
D) Fuzzy Set

13. What is the process of converting crisp values to fuzzy values known as?
A) Defuzzification
B) Normalization
C) Fuzzification
D) Quantization

14. Which technique is used to convert fuzzy values back to crisp values?
A) Defuzzification
B) Fuzzification
C) Crispification
D) Normalization

15. Which of the following is NOT a typical shape of a membership function?


A) Triangular
B) Trapezoidal
C) Sigmoid
D) Parabolic
16. In fuzzy logic, which operation represents "AND"?
A) Maximum
B) Minimum
C) Average
D) Union

17. Which of these is a commonly used defuzzification method?


A) Center of Gravity (COG)
B) Average Sum
C) Union and Intersection
D) None of these

18. In fuzzy logic, values range between:


A) 0 and 1
B) -1 and 1
C) 0 and 100
D) 0 and 10

19. Fuzzy logic is mainly used in systems that require:


A) Precise and exact outputs
B) Probabilistic reasoning
C) Human-like reasoning
D) Pure numerical analysis

20. Which process in fuzzy logic involves the use of linguistic variables?
A) Defuzzification
B) Quantization
C) Fuzzification
D) Discretization
Module 5: Neural Networks
21. What is the simplest form of a neural network?
A) Perceptron
B) Recurrent Network
C) Convolutional Network
D) Modular Network

22. The basic structure of a neural network consists of:


A) Layers of neurons
B) Stack of nodes
C) Single-layer circuits
D) Algorithms for fuzzy logic

23. The process of adjusting weights in a neural network to minimize error is called:
A) Forward Propagation
B) Weighting
C) Backpropagation
D) Feedback adjustment

24. In neural networks, what type of function is typically used in hidden layers?
A) Step Function
B) Activation Function
C) Simple Sum Function
D) Constant Function

25. The perceptron model was introduced by:


A) Alan Turing
B) Frank Rosenblatt
C) Geoffrey Hinton
D) Marvin Minsky

You might also like