CS607-Artificial Intelligence Quiz MCQS #Objective #Questions #MidTerm
1. In ___ search(es), we only have one agent searching solution space to find goal state
- Depth first search
- Breadth first search
- Progressive search
- All of the given ✔
2. Solving 32-bit computer words using genetic algorithm we want a string in which all the bits are ones. We count the 1 bits in each word and exit if any of the words having all 32 bits set to 1 by using ___
- initial population
- evaluation function ✔
- mutation
- search space
3. The initial state and the legal moves for each side define the ___ for the game
- search tree ✔
- game tree
- state-space search
- forest
4. Which of the following are the main phrases of the linear sequence?
- Code
- System evaluation
- Planning
- All of the above ✔
5. ___ is used when the facts of the case are likely to change after some time.
- Inductive reasoning
- Non-Monotonic reasoning ✔
- Analogical reasoning
- Common-sense reasoning
6. Which of the following is NOT one of the drawbacks of depth first search?
- Can run forever in search spaces with infinite length paths
- Does not guarantee finding the shallowest goal
- Requires the tree to be a complete tree
- Cut-off depth is similar so time complexity is more ✔
7. In eight queen problem for the given sequence 1 6 5 3 2 5 3 7 the position of Q4 queen is at ___
- fourth column and third row ✔
- second column and third row
- first column and third row
- eight column and second
8. In ___ we may have multiple agents searching for solution in the same solution space
- Adversarial search ✔
- Depth first search
- Breadth first search
- Progressive deepening
9. Which of the following is/are considered being trait(s) of an expert?
- They possess specialized knowledge in a certain area
- They possess experience in the given area
- They can provide, upon elicitation, an explanation of their decisions
- All of the given ✔
10. In CLIPS, the Defrule construct is used to add ___
- rules ✔
- facts
- principles
- All of the above
11. Every graph can be converted into a tree
- True ✔
- False
12. Reasoning in backward chaining is known as:
- Data-driven reasoning
- Rule-driven reasoning
- Intelligence-driven reasoning
- Goal-driven reasoning ✔
13. The simple idea behind ___ is that if we can reach a specific node through more than one different paths then we shall take the path with the minimum cost
- Dynamic programming ✔
- Estimates
- Progressive deepening
- Beam search
14. The problem is to place 8 queens on a chess board by using genetic algorithm, so that none of them can attack the other. A chess board can be considered as a plain board with ___ columns and ___ rows
- eight, six
- eight, seven
- eight, eight ✔
- eight, nine
15. Progressive deepening emulates BFS using DFS
- True ✔
- False
16. Genetic algorithms use ___
- parallel approach ✔
- sequential approach
- pipelining
- all of the mentioned
17. Expert system technique where a hypothesis is given at the beginning and the inference engine proceeds to ask the user questions about selected facts until the hypothesis is either confirmed or denied
- Network Knowledge ✔
- Data mining
- Backward chaining
- Forward chaining
18. The component of the system that performs inference is called:
- inference engine ✔
- inference object
- inference manager
- inference class
19. LISP was created by?
- Alan Turing
- Marvin Minsky
- John McCarthy ✔
- Allen Newell and Herbert Simon
20. To which depth does the alpha-beta pruning can be applied?
- 10 states
- 8 states
- 6 states
- Any depth ✔
21. “Specialized knowledge” in human experts is referred to as ___ when it comes to an expert system
- Affirmation knowledge
- Domain knowledge ✔
- Reasoning knowledge
- Predicate engine
22. A natural language generation program must decide ___
- what to say
- when to say something
- why it is being used
- both what to say & when to say something ✔
23. ___ combine predicates and quantifiers to represent information
- Objects
- Subjects
- Formulae ✔
- Constants
24. In CNF(Conjunctive normal form) the outermost structure is made up of ___ and inner units called clauses are made up of ___
- conjunctions, disjunctions ✔
- disjunctions, conjunctions
- resolution, refutation
- refutation, resolution
25. The formulae (∃x)(Person(x) ∧ father(x, Ahmed) ) can be translated in simple words and read as
- there exists some person, x who is Ahmed’s father✔
- for all person, x who is Ahmed’s father
- there exists some person, x who is Ahmed’s daughter
- for all person, x who is Ahmed’s daughter
26. Adversarial search problems uses ___
- competitive environment
- cooperative environment ✔
- neither competitive nor cooperative environment
- an only competitive and cooperative environment
27. Which of the following command is correct for adding numbers in CLIPS?
- CLIPS> (3+4)
- CLIPS> (+ 3 4) ✔
- CLIPS> (3 4 +)
- CLIPS> (+ 3 4 +)
28. A fact or proposition is divided into two parts and are represented as ___
- object and logic ✔
- predicate and argument
- reasoning and variable
- algebra and calculus
29. ___ describes objects, rather than processes. That is known about a situation, e.g. it is sunny today, and cherries are red
- Procedural knowledge
- Declarative knowledge ✔
- Meta knowledge
- Heuristic knowledge
30. ___ are able to override the normal rules in expert systems
- Meta rules
- Conflict resolution rules
- Forward chain rules ✔
- Backward chain rules
