cs607 Grand quiz 2021

CS607 ARTIFICIAL INTELLIGENCE
GRAND QUIZ SPRING 2021

1. _______ is a branch and bound technique with the improvement of under estimates and
dynamic programing
• A* Procedure pg#56
• Progressive deeping
• Beam search
• Linear search
2. The machine has ______ it would have used its knowledge to counter from this new
situation in its environment
• Strong artificial intelligence pg#9
• Weak artificial intelligence
• Efficient algorithms
• None of the above
3. A statement in conjunctive normal form (CNF) consists of __________
• ANDs of Ors pg#107
• ANDs
• Ors
• Ors of ANDs

4. Cost of a human expert is ______ as compared to an expert system
• High pg#113
• Low
• Medium
• Average
5. Some essential components of a problem solving are Problem statement ,_______
Solution Space and Operators
• Complex State
• Initial State
• Intermediate State
• Goal State pg#17
6. Which of the following is/are being trait(s) of an expert
• They possess specialized knowledge in a certain area
• They possess experience in a given area
• They can provide upon elicitation, an explanation of their decisions
• All of the given options pg#111
7. “In context of Hill climbing algorithm, a person may reach a portion of a mountain
which is totally flat, whatever steps he takes give him no improvement in height hence
he gets stuck” the above statement refers to;
• Foothill problem
• Plateau problem pg#40
• Ridge problem
• Slope problem
8. The searching technique in which we purely use a hit and trial approach and will check
all combinations till one takes it to the exact solution is referred to as ______
• blind/uninformed pg#23
• informed/heuristic
• path/non-optimal
• optimal path
9. ______ have the same notion of having something or some attribute from a parent
• Mutation
• Gene
• Inheritance pg#77
• All of the above
10. The depth First Search traversal of a graph will result in?
• Linked List
• Tree pg#25
• Graph with black edges
• Array
11. LISP was created by ?
• Alan Turing
• Marvin Minsky
• John McCarthy pg#10
• Allen Newell and Herbert Simon
12. The process continues recursively until a premise is found that is not supported by a rule.
i-e, a premise is called a _______ if it cannot be concluded by any rule
• elementary
• primitive pg#126
• antique
• all of the above
13. If alpha implies beta is true and beta is known to be not true, then alpha could not have
been true. This rule refers to:
• Modus ponens
• Modus Tolens pg#105
• And-Introduction
• And-Elimination
14. MYCIN was an important system in the history of AI because it demonstrated that
expert system could be used for solving practical problems for _______
• Physicians pg#112
• Engineers
• Students
• Lawyers
15. “Focused area of expertise” in human experts is referred to as _____ in expert systems
• Domain pg#116
• Knowledge
• Reasoning
• Inference engine
16. Which of the following commands is correct for adding numbers in CLIPS ?
• CLIPS>(3+4)
• CLIPS>(+3 4) pg#133
• CLIPS>(3 4+)
• CLIPS>(+3 4+)
17. Hit and trial is a classical approach to solve the ______ problems easily
• Trivial pg#15
• Medium
• Complex
• Structured
18. “In context of Hill climbing algorithm, situations may arise when a step in one direction
takes you lower, on the other hand when you step in some other direction it gives you no
improvement” The above statement referred to:
• Foothill problem
• Plateau problem
• Ridge problem pg#40
• Slope problem
19. We use graphs to represent problems and their solution spaces
• False
• True pg#22
20. In Genetic algorithm ______ has the same notion of having something or some attribute
from a parent while ______ refers to a small random change
• Inheritance, mutation pg#77
• DFS, BFS
• “A”, Dynamic programing
• Subtraction, multiplication
21. ______ alters one or more gene values in a chromosome from its initial state
• Inheritance
• Mutation (Google)
• Gene
• All of the above
22. According to Kurzweil artificial intelligence systems are ______
• think like humans
• act like humans pg#7
• behave like an abnormal men
• none of the above
23. Graphs and Networks allow ____________ between objects/entities to be incorporated:
• Relationships pg#92
• Pictures
• Representation
• Communication
24. Back-propagation learning algorithm was invented by _____________:
• Bryson and Ho pg#12
• John McCarthy
• Marvin Minsky
• Alan Turing
25. The simple idea behind _________________ is that if we can reach a specific node
through more than one different paths then we shall take the:
• Dynamic programming pg#55
• Estimates
• Progressive deepening
• Beam search
26. CLIPS stands for”
• C Language Integrated Production System pg#133
• C# Language Integrated Production System
• COBOL Language Integrated Production System
• C++ Language Integrated Production System
27. The simplest way to perform _____________ is to combine the head of one individual to
the tail of the other:
• Mutation
• Crossover pg#82
• DFS
• BFS
28. Variation in the offspring’s(children) of the individuals are due to _________:
• Mutation
• Inheritance pg#77
• Both mutation and inheritance
• Crossover
29. The symbol for the existential qualifier is represented as ___________. it is also read as
“there exists”:
• →
• ꓯ
• ꓱ pg#100
• ꚛ
30. In CLIPS, the Defrule construct is used to add __________:
• Rules pg#135
• Facts
• Principles
• Agenda
31. In ____________ search, rather than trying all possible search paths, we focus on paths
that seem to be getting closer to goal state using some kind of “guide”.
• Heuristic pg#37
• Uninformed
• Depth first
• Progressive deepening
32. Which of the following is not considered being trait(s) of an expert?
• They possess specialized knowledge in certain area
• They possess experience on the given area
• They can provide, upon elicitation, an explanation of their decision
• They possess long term memory pg#111
33. Which of the following is NOT one of the expert systems?
• Dendral
• Mycin
• XOR pg#112
• R1/XCON
34. 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 pg#100
• 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
35. _________ are data structures for representing stereotypical knowledge of some concept
or object:
• Frames pg#98
• Resolutions
• Conjunctions
• Disjunction
36. ability to tackle ambiguous and fuzzy problems demonstrate:
• intelligence pg#6
• non intelligence behavior
• deep learning
• machine learning
37. Which approach is used by the Best First Search algorithm while searching?
• Divide and Conquer
• Heuristic
• Greedy pg#47
• Combinatorial
38. We use graphs to represent problems and their ______:
• Knowledge base
• Solution spaces pg#22
• Parameters
• Nodes and vertices
39. Describe objects, rather than processes. That is known about a situation. E.g. it is a
sunny today and cherries are red.
• Procedural knowledge
• Declarative knowledge pg#90
• Meta knowledge
• Heuristic knowledge
40. The conference that launched the Al revolution in 1956 was held at?
• Harvard
• Dartmouth pg#10
• New York
• Stanford
41. Progressive deepening emulates BFS using DFS
• True pg#32
• False
42. 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
---------- column and ---------- rows.
• Eight, six
• Eight, seven
• Eight, eight pg#82
• Eight, nine
43. Alpha beta pruning relates to:
• Minmax procedure pg#64
• Breadth first search
• Progressive deepening
• Depth first search
44. The Depth First Search traversal of a graph will result in?
• Linked list
• Tree pg#25
• Graph with back edges
• Array
45. “In context of Hill climbing algorithm, you might just reach local maxima and thinked
that you have reached the global maxima, so getting stuck in the middle of searching the
solution space”. The above statement refers to:
• Foothill problem pg#39
• Plateau problem
• Ridge problem
• Slope problem
46. Genetic algorithm uses evolutionary techniques, based on function optimization and
artificial intelligence to develop a solution.
• True (Google)
• False
47. In progressive depending the idea is to simply apply DFS to a specific.
• Level pg#32
• Node
• Branch
• Branching factor
48. In Al cycle------------ are closely coupled components each is intrinsically tied to the
other.
• Knowledge representation and reasoning pg#89
• Learning and execution
• Perception and planning
• Learning and planning
49. In the worst case of semantic network, we may need to traverse the entire network and
then discover that the requested info-----------
• Does not exist pg#97
• Exists
• Is incorrect
• Is correct
50. Which of the following is the component of problem-solving?
• Operator
• Solution space
• Problem statement
• All of the above pg#17
51. To implement simple search algorithm as breadth first search, we use the formula given
below and give priority to element with --------- P(n) value where: p(n) = height(n)
• Minimum
• Maximum
• Average
• Absolute
52. In_______searches we are concerned with finding any one solution to our problem.
• Non optimal pg#24
• Optimal path
• Contrary path
• Shortest path
53. A fact or proposition is divided into two parts and are represented as___________.
• Object and logic
• Predicate and argument pg#101
• Reasoning and variable
• Algebra and calculus
54. The domain of intelligence in which machines that act intelligently and they have real
conscious minds is called_________.
• Strong AL pg#8
• Weak AL
• Intermediate AL
• Strong AL & week AL
55. In genetic algorithm, we produce the next generation from the______.
• Genes and inheritance
• Inheritance and mutation pg#77
• Mutation and genes
• Crossover
56. Most of the solution for problems can be represented in a__________.
• Graph pg#21
• Table
• Demo
• Tree
57. Some essential components of problem solving are Problem statement.________.
Solution Space and Operators.
• Complex State
• Initial State
• Intermediate state
• Goal state (Page 17)
58. Which of the following is not a component of an expert system?
• Inference engine
• Knowledge-base
• User interface
• Template (Page 116)
59. Hill climbing is basically a_-------- search with measure of quality thay is assigned to
each node in the tree
• Depth first pg#39
• Breadth first
• Uninformed
• Progressive deepening
60. If Ali is 2 year younger than Umar and Umar is 23 year old. How old is Ali?
• Ali is 22 years old
• Ali is 21 years old pg#10
• Ali is 23 years old
• Ali is 20 years old
61. Trying to catch out own thoughts as they go by
• Introspection pg#8
• Psychological Experiments
• Introspection and Psychological experiments
• None of the given
62. “Given that there is dry Wood, oxygen and a spark we can conclude that there will be
fire” the above statement refers to:
• Inductive reasoning
• Abductive reasoning
• Deductive reasoning pg#102
• Common-sense reasoning
63. Genetic algorithm start with the population of randomly generated, attempted solution to
a problem and repeatedly do the following except--------------
• Evaluate each attempted solution
• Keep the best solutions
• Produce next generation using inheritance and mutation
• Perform non parallel search (Page 77)
64. ----------- can be viewed as a processor in an expert system
• Inference engine pg#117
• Working memory
• Knowledge base
• System memory
65. Psychological experiment deal with the study of--------
• Introspection
• Study of mind
• Science of mental life pg#8
• None of the mentioned
66. The ability to learn and recognize things automatically called?
• Fuzzy logic
• Intelligence (Page 06)
• Both of the above
• None of the above
67. The expression “the cat drove the car” is ------------ correct. But---------non-sensible
• Logically, inductively
• Deductively, inductively
• Syntactically, semantically pg#104
• Monotonically, non-monotonically
68. To create intelligent machine we first need to understand how the real--------
• Introspection of mind
• Psychological experiment
• Brain functions (Page 14)
• None of the above
69. Graphs are used to represent ----------- and----------
• Problem, solution (Page 22)
• Terminals, branches
• Both of the above
• None of the above
70. The state that represents the solution of the problem is called____________.
• Solution space
• Goal state (Page 17)
• Problem statement
• Knowledge base
71. What is artificial intelligence?
• Putting your intelligent into computer
• Programming with you intelligence
• Making a machine intelligent (Page 7)
• Playing a game
72. Speed of an expert system is___________ as compared to a human expert.
• High (Page 113)
• Low
• Medium
• Average
73. In a sequence 2 6 8 3 4 5 3 1, where will the value of Q5 placed in 8 queen problem.
• 2nd row and first column
• 7th row and 6th column
• 4th row and 5th column (Page 84)
• 3rd row and 2nd column
74. The process of working with knowledge, facts and problem solving strategies to draw
conclusions. The above statement refers to:
• Reasoning (Page 102)
• Object-attribute-value-triplet
• Refutation
• Conversion
75. Adversarial search problem uses ___________:
• Competitive environment (Google)
• Cooperative environment
• Neither cooperative nor competitive
• An only competitive and cooperative environment
76. IF A THEN B
This can be considered to have similar logical meaning as the following:
• A->B (Page 99)
• A<->B
• A<-B
• B<->A
77. Using deduction to reach a conclusion for a set of antecedents is called
• Forward chaining (Google)
• Backward chaining
78. An expert system models the following aspect(s) of human expert
• Operations
• Implications
• Knowledge and reasoning (Page 111)
• None of the given options
79. _______ are able to override the normal rules in expert systems:
• Meta rule (Google)
• Conflict resolution rules
• Forward chain rules
• Backward chain rules
80. Which of the following command is used to see the added facts in CLIPS?
• (fact)
• Fact
• (facts) (Page 134)
• Deftemplate
81. Which of the following is not a branch and bound strategy to generate branches?
• LIFO branch and bound
• Lowest cost branch and bound
• FIFO branch and bound
• Highest cost branch and bound (Google)
82. “I have never seen horses eating meat, so I conclude that horses never eat meat”. The
given statement refers to :
• Inductive reasoning (Page 102 (Conceptual)
• Abductive reasoning
• Common-sense reasoning
• Non-monotonic reasoning
83. According to Haugeland intelligence systems are _______
• Think like humans page 7
• Act like humans
• Behave like and abnormal man
• Behave like humans
84. A function by which we can tell which board position is nearer to our goal is called.
• Alternative function
• Recursive function
• Bets function
• Fitness function page 83
85. A circle symbol in a tree structure is called.
• Node page 21
• Edge
• Ancestor
• Descendant
86. “Swimming in river is just like swimming in pool”. The given statement is an example
of.
• Analogical reasoning page 103
• Logical reasoning
• Non-monotonic reasoning
• Inductive reasoning
87. An AI system must form a meaningful and useful ______ of the internal information.
• Representation 89
• Execution
• Leaning
• Planning
88. For [5, 7] and the data points (1, 10) and (2, 13) then what will be the value of the
badness?
• 12
• 20 page 79
• 22
• 24
89. The traveling inside a solution space requires something called as ____
• Operands
• Inner solution
• Space solution
• Operators page 18
•
90. There are many techniques to solve our problem of optimal search without using a brute
force technique, one such procedure is called _____
• Branch-and-bound method page 48
• Depth first method
• Breadth first method
• Progressive deepening
•
91. The formula (3x) (person x) ^ father (x, Ahmed) can be translated in simple words and
read as.
• There exist some person, x who is Ahmed’s father. Page 100
• For all person, x who is Ahmed’s father.
• There exist some person, x who is Ahmed’s daughter.
• For all person, x who is Ahmed’s daughter.
92. Which of the following is not an application area of intelligence?
• Robotics
• Expert system
• Computer vision
• Human computer interaction page 14,111
93. ________ can be as simple as just flipping a bit of a random or any number of bits
• Mutation page 79
• Crossover
• Gene
• Inheritance
94. We can get _____ solution given some parameters using genetic algorithm
• Optimal page 79
• Formal
• Complex
• Structured
95. _____ can be viewed as the processor in an expert system.
• Inference engine page 117
• Working memory
• Knowledge base
• Systems memory
96. In _______ reasoning the conclusion derived may be wrong.
• Abductive page 103
• Monotonic
• Deductive
• Inductive
97. According to De Morgan’s laws:
˜ (A˅B) =?
Note: “˜” represents negation.
• ˜A - > B
• ˜B - > A
• ˜A ^ ˜ B page 108
• ˜B - > ˜ A
98. The components of a statement in CNF (Conjunctive normal form) are clauses and
literals. And clause in CNF is the _____ of many units.
• Disjunction page 108
• Conjunction
• Separation
• Subtraction
99. In CNF the outermost structure is made up of ____ and inner units called clauses are
made up of _____.
• Conjunctions, disjunctions page 108
• Disjunctions, conjunctions
• Resolution, refutation
• Refutation, resolution
100. Which research method takes less memory?
• Depth-first search page 32+Google
• Breadth-first search
• Optimal search
• Linear search
101. The data structure used in the standard implementation of breadth-first search is?
• Stack
• Queue
• Linked list
• Tree page 28
102. Which searching technique gives us a better solution every time?
• Blind/uniformed
• Informed/heuristic page 24
• Path/non-optimal
• Optimal path
103. Identify the TRUE statement about alpha-beta pruning:
• It reduces both the tree branches that must be generated and the number
of evaluations page 64
• It decides about branching factor in a tree
• It is core of progressive deepening search
• Beta is the maximum upper bound of possible solutions
104. Eight queen problem illustrates that placement of 8 queens on a chess board so that
none of them can _____ the other.
• Attack page 82
• Breed
• Mutate
• Generate
105. What is the fitness value of the following sequence 4 6 8 2 7 1 3 5 in eight queen
problem?
• 6
• 7
• 8 page 86
• 9
106. Which of the following is not a search strategy?
• Blind/ uniformed search
• Informed/ heuristic search
• Any path search
• Leaf path search page 23
107. An AI system has a _______ component that allows the system to get information
from its environment.
• Planning
• Perception page 89
• Learning
• Execution
108. Back-propagation learning algorithm was invented by _____
• Bryson and Ho
• John McCarthy
• Marvin Minsky page 159
• Alan Turing
109. Which expert system was designed for chemical analysis of Martian soil for space
mission?
• MYCIN
• Dendral page 112
• R1/XCON
• PXDES
110. Every graph can be converted in to a _______?
• Tree page 22
• Statement
• Problem
• Repeated cycle
111. Resolution requires all sentences to be converted into a special form called:
• Conjunctive normal form (CNF) page 107
• Third normal form
• De-normalized form
• 1st normal form
112. In CLIPS, the _____ command is used for debugging programs.
• FACT
• WATCH 135
• CLEAR
• DEBUG
113. What are the components of a rule?
• Else than then
• Premise and conclusion page 95
• Then and break
• If and else
114. In GA the random process is repeated until an individual with required ____ level is
found.
• Higher
• Lower
• Fitness page 86
• Logical
115. _____ is used when the facts of the case are likely to change after some time.
• Inductive reasoning
• Non-Monotonic reasoning page103
• Analogical reasoning
• Common-sense reasoning
116. Variable rule is matched with known facts and different possibilities for the variables
are tested, to determine the truth, such rules are also called as _______.
• Uncertain rules
• Directive rules
• Fuzzy rules
• Matching rules page 96
117. In CLIPS, the Defrule construct is sued to add ______.
• Rules page 135
• Facts
• Principles
• Agenda
118. _____ AI actually tries to recreate the functions of the inside of the brain as opposed
to simply emulating behaviour.
• Weak
• Strong page 8
• Weak and strong
• Intermediate
119. What is the correct order for solving a problem using GA
I. Choose the best individuals form the population for crossover
II. Choose initial population
III. Evaluate the fitness of each individual
• I,II,III
• I,III,II
• II,I,III
• II,III,I page 84
120. _______ is the type of knowledge that can be described as the knowledge about
knowledge.
• Declarative knowledge
• Uncertain knowledge
• Meta knowledge page 90
• Fuzzy knowledge
121. In _____ search we may have multiple agents searching for solutions in the same
solution space.
• Adversarial search page 62
• Depth first search
• Breadth first search
• Progressive deepening
122. How many types of facts are there in formal knowledge representation?
• 4 page 94
• 5
• 6
• 7
123. ------------------- type of knowledge can be represented as the Rule-of Thumb
• Procedural
• Semantic
• Meta
• Heuristic page 90
124. Genetic Algorithm is---------------------- in which multiple search path are
followed in parallel.
• Search method page 77
• Data structure
• Sorting algorithm
• Type of tree
125. Genetic algorithm use_____________
• Parallel approach page 76
• Sequential approach
• Pipelining
• Heuristic approach
126. The simplest way to perform ------------- is to combine the head of one
individual to the tail of the other.
• Mutation
• Crossover page 82
• DFS
• BFS
127. Some essential components of problems solving are problem statement. --------
---------Solution Space and Operators.
• Complex State
• Initial State
• Intermediate State
• Goal State page 17
128. Which of the following tells us about the problem-solving, correct efficient
memory, and information manipulation?
• Deep learning
• Intelligence page 6
• Machine Learning
• Deep learning
129. MYCIN was an important system in the history of AI because it demonstrated
that expert systems could be used for solving practical problems for_________
• Physicians page 112
• Engineers
• Students
• Lowers
130. The process continues recursively until a premise is found that is not
supported by a rule, i.e. a premise is called a ----------------- if it cannot be concluded by
any rule.
• Elementary
• Primitive page 126
• Antique
• Secondary
131. Which of the following disciplines provides us with the theories of structure
and meaning of language.
• Linguistic page 9
• Philosophy
• Biology
• Psychology
132. In the linear model which is not the step of the planning phase?
• Feasibility assessment
• Resource allocation
• Task phasing and scheduling
• Knowledge engineering page 129
133. The ability to think, plan and schedule demonstrate___________________
• Problem-solving
• Intelligence (Page 04)
• Machine learning
• Deep learning
134. A search algorithm takes ----------as an input and returns----- as an output
• Input, output
• Problem, solution (Google)
• Solution, problem
• All of the mentioned
135. Which value is assigned to alpha and beta in the alpha beta pruning?
• Alpha = max
• Beta = min
• Both alpha = max & beta = min (Google)
• Beta = max
136. General games involves__________.
• Single-agent
• Multi-agent
• Only Single-agent and Multi-agent (Google)
• Neither Single-agent and Multi-agent
137. The Data structure used in the implementation of Depth-First Search is?
• Stack (Google)
• Queue
• Linked List
• Recursion
138. Solving 32-bit computer words using genetic algorithm we want a string in which all
the bits are ones. We count the 1 bit in each word and exit if any of the words having all
32 bits set to 1 by using____________.
• Initial population
• Evaluation function page 78
• Mutation
• Search space
139. Which of the following is NOT one of the steps of simple search algorithm?
• Initialize priority queue
• Check if the priority queue is empty
• If node picked from priority queue is goal node then return
• Copy visited queue to priority queue (Page 24)
.
140. Inference engine matches the facts contained in the _____with the ______contained
in the knowledge base. To drew conclusions about the problem.
• Rule engine. Operators
• Fact table. Working memory
• Working memory. Domain knowledge page 117
• Object. Class
141. In intelligence to solve the trivial problem we use________approach
• Hit and trial page 15
• Trial and error
• Dynamic programming
• Divide and conquer
142. “if you find the goal , exit otherwise repeat DFS to the next lower level” the statement
refers to
• Depth First search
• Breadth first search
• Progressive deepening page 32
• None progressive deepening
143. Which of the following is not the main phase of the linear sequence?
• Code
• System evaluation
• Planning
• Requirement engineering page 129
•
144. A_____ search out of “n” possible choices at any level, we only follow the best “k” of
them
• Beam search page 43
• Breadth first search
• Depth first search
• Progressive deepening
145. Relationship between objects and concepts represent which type of knowledge?
• Declarative page 90
• Structural
• Heuristic
• Meta
146. _______combine predicates and quantifiers to represent information
• Object
• Subject
• Formulae page 101
• Constants
147. Which is the other name of informed search strategy
• Simple search
• Heuristic search pg#39
• Online search
• None of the mentioned
148. A proposition is the statement of a________
• Equation
• Action
• Theorem
• Fact pg#94
149. What will be the output when we will remove arrow?
A->B
• ¬A∨ ¬B
• ¬A∨ B pg#110
• A∨¬ B
• ¬A AND B
150. A knowledge structure that relates some known information to other information that
can be concluded or interred to be true in representation as________.
• Object
• Attribute
• Value
• Rule pg#95
151. The genetic algorithm technology comes from the concept of _______ evolution.
• Animals
• Robots
• Human pg#76
• Artificial intelligence
152. How many types of rules are there in formal knowledge representation?
• 4
• 5
• 6
• 7 (Page 96)
153. --------- is a genetic operator used to maintain genetic diversity from one generation of
a population of genetic algorithm chromosomes to the next
• Inheritance
• Mutation (Google)
• Gene
• All of the above
154. Which particular generation of computers is associated with artificial intelligence
• Second
• Fourth
• Fifth (Google)
• Third
155. How many types of graphs are there to use in problem-solving?
• 1
• 2
• 3
• 4 (Google)
156. In context of tree, an arrow from one to other is called
• Root
• Edge (Page 21)
• Ancestor
• Descendant
157. Reasoning in backward chaining is known as
• Data-driven reasoning
• Rule-driven reasoning
• Intelligence-driven reasoning
• Goal-driven reasoning (Google)
158. In Breadth First Search how many times a node is visited?
• Once (Google)
• Twice
• Equivalent to number of in-degree of the node
• Thrice
159. Expert system can be expressed as:
• It provides tools for the management, delivery, tracking and assessment of
various type of employee learning and training
• The set of business processes , culture and behavior require to obtain value from
investment in information systems
• Used for finding the optimal solution for a specific problem by examining a very
large number of possible solutions for that problem
• Intelligent technique for capturing tactic knowledge in a very specific and
limited domain of human expertise , this knowledge is converted to rules
that can be used throughout the entire (Google)
160. A computer vision technique that relies on image templates is _______
• edge detection
• model-based vision (Google)
• robot vision
• none of the mentioned
161. If an arrow points from node ‘A’ to node ‘B’ then node ‘B’ will be called
• child of node ‘A’ (Google)
• parent of node ‘A’
• Branching factor of node ‘A’
• Fan-out of node ‘A’
162. Expert system technique where a hypothesis is given at the beginning and the
interference engine proceeds to ask user question about selected facts until the
hypothesis is either confirmed or denied.
• Network Knowledge
• Data Mining
• Backward chaining (Google)
• Forward chaining
163. One of the advantage of breadth first search is that it:
• Guarantees finding the shallowest path even in presence of
infinite paths (Page 32)
• Has a small space requirement
• Can work with broken edges
• Memory constraints
164. Answering the sequence problem need
• Intelligence (Page 15)
• Ability to make plan
• Ability to schedule
• Machine learning
165. Which values are independent in the minimax search algorithm?
• Pruned leaves x and y (Google)
• Every state are independent
• Root is independent
• Non pruned leaves
166. To which depth does the alpha-beta pruning can be applied?
• 10 states
• 8 states
• 6 states
• Any depth (Google)
167. What will be the conjunctive normal of (A - > B)?
• (A ˅B)
• (A AND B)
• (⌐A˅B)
• (A ˅ ⌐B)
168. Rule which may have a priority in expert systems, is called
• Meta rule
• Conflict resolution rule (Page 125+126)
• Forward chain rule
• Backword chain rule
169. Within an expert system, the _____ contains facts about a specific subject area and
rules that expresses the reasoning procedures for an expert on the subject.
• Interface engine
• Knowledge engineer
• Knowledge base (page 117)
• Interface logic
170. A V (B ^ C) =
Note:
“V” represents OR operator
“^” represents AND operator
• (A V B) ^ (A V C) (Page 108)
• (A ^ B) ^ (A ^ C)
• (A V B) V (A V C)
• (A V C) V (A V B)
171. Which of the following best represents the fuzzy logic?
• A method of reasoning that resembles human reasoning.
(Google)
• A method of question that resembles human answer
• A method of giving an answer that resembles human answer.
• A method that resembles with problem solving technique
172. The ability to understand things without explicitly programed a computer is called
• Artificial intelligence
• Deep learning
• Machine learning (Google)
• Fuzzy logic
173. Which of the following is the name of the algorithm that evolves the concept of our
genes
• Statistical algorithm
• Genetic algorithm (Page 77)
• Searching algorithm
• Conventional algorithm
174. Where does the values of alpha-beta search get updated
• At the end
• Along the path of search (Google)
• Initial state itself
• At the beginning
175. A personal Consultant knowledge base contains information in the form of ________.
• Parameters (Google)
• Rules
• Facts
• Errors
176. The travelling made a solution space requires something called
• Operands
• Inner solution
• Space solution
• Operators (Page 18)
177. Which of the following statement is true?
• A graph may contain no edges and many vertices (Google)
• A graph may contain many edges and no vertices
• A graph may contain no edges and no vertices
• A graph may contain no vertices and many edges
178. __ says that from “Alpha” and from “Beta” you can conclude “Alpha and Beta”.
• Modus tolens
• Modus ponens
• And-Elimination
• And-Introduction pg#105
179. The Data structure used in the standard implementation of Depth-First-Search is?
• Recursion Google
• Stack
• Queue
• Linked List
180. Which of the following is not the component of problem-solving?
• Solution space
• Problem statement
• Operators
• Operations pg#17
181. R1/XCON expert system was developed by?
• Digital Equipment Corporation pg#112
• Computer accessories company
• Digital Computer Corporation
• DELL
182. In generic problem we start with a population of randomly generated ___ to a problem.
• Attempted solutions pg#77
• Final state
• BFS
• DFS
183. “Specialized knowledge” in human experts is experts is referred to as __, when it comes to
an expert system.
• Domain Knowledge pg#115
• Reasoning Knowledge

• Predicate engine
• Affirmation knowledge
184. The components of a statement in CNF are clauses and literals, A clause in CNF is
the........of many units
• sepration
• disjunction pg#108
• conjunction
• subtraction
185. ___ is based on deducing new information from logically related known information.
● Common-sense reasoning
● Abductive reasoning
● Deductive Reasoning pg#102
● Inductive reasoning
186. From discipline of __ we have information about the network structure of a human brain and
all the theories on functionalities of different human organs.
● Computer Science
● Biology pg#9
● Mathematics
● Psychology
187. Facts are atomic unit of knowledge they represent the following type of knowledge
• .Declarative knowledge pg#94
• .Meta knowledge
• .Procedural Knowledge
• .Common knowledge
188. An alternative method is the longest-matching strategy. This method involves firing the
conclusion that was derived from the ___.
● Longest rule Google
● Forward chain rule
● Complex rule
● Shortest rule
189. Implication can also be represented as
(A B)?
• ⌐A ∧ B
• ⌐A V B (Page 108)
• A V⌐B
• A ∧ ⌐B
190. The initial state and the legal moves for each side define the_________ for the game.
• Search tree
• Game tree (Google)
• State-space search
• Forest
191. In eight queen problem the given sequence 2 6 8 3 4 5 3 1 illustrates that in __ column the
queen is placed in the __ row.
• sixth, second
• first, fifth
• second, sixth (Page 83)
• third, fifth
192. Branch and bound is a ------------
• Data structure
• Problem-solving technique (Google)
• Solving algorithm
• Type of tree
193. Line fitting problem using genetic algorithm, if the badness of any of the
solution is ______ it means that given points lies on the line
• Zero (Not sure)
• One
• Two
• Three
194. Line fitting problem using genetic algorithm, if the badness of any of the
solution is ______ it means that given points lies on the line
• Zero (Not sure)
• One
• Two
• Three
195. The rules that define how conflict resolution will be used. And how aspects of
the system itself will run. Are called__________.
• Meta rules
• Conflict resolution rules (Google Files)
• Forward chain rules
• Backward chain rules
196. --------- is the part of system that controls the process of deriving conclusions
• A knowledge base
• A database of facts
• An interpreter, or inference engine (Google not sure)
• An object
197. A natural language generation program must decide
• What to say
• When to say something
• Why it is being used
• Both what to say and when to say something (Google Files)