Question

Intelligence is the characteristic of

1. Living being
2. All things
3. None of them
4. All of them

Answer: 1

Chapter No. 1

Question

Can we precisely define Artificial Intelligence?

1. Yes we can
2. No we can not

Answer: 2

Chapter No. 1

Question

Which of the following things demonstrate Intelligence?

1. Problem solving
2. Recognize/Remember
3. Think/learn/Plan/Schedule
4. All of the above

Answer: 4

Chapter No. 1

Question

Try to catch out own thoughts as they go by is ________.

1. Introspection
2. Psychology
3. Both of given
4. None of the given

Answer: 1

Chapter No. 2

Question

Intelligence is the ability to ____________.

1. Think/learn/Plan/Schedule
2. Recognize/Remember
3. Problem solving
4. All of the above

Answer: 4

Chapter No. 2

Question

__________ AI actually tries to recreate the functions of the inside of the brain as opposed to simply emulating behavior.

1. Weak
2. Strong
3. Weak and Strong
4. None of the given

Answer: 2

Chapter No. 2

Question

__________ AI treats the brain as a black box and just emulates its functionality.

1. Weak
2. Strong
3. Weak and Strong
4. None of the given

Answer: 1

Chapter No. 2

Question

From discipline of _____________ we have the tools and techniques to investigate the human mind and ways to represent the resulting theories.

1. Computer Science
2. Biology
3. Mathematics
4. Psychology

Answer: 4

Chapter No. 3

Question

From discipline of _____________ we have information about the network structure of a human brain and all the theories on functionalities of different human organs.

1. Mathematics
2. Biology
3. Computer Science
4. Psychology

Answer: 2

Chapter No. 3

Question

Which of the following disciplines provides us with the theories of structure and meaning of language?

1. Linguistic
2. Philosophy
3. Biology
4. Psychology

Answer: 1

Chapter No. 3

Question

Hit and trial is a classical approach to solve the ___________ problem easily.

1. Trivial
2. Medium
3. All of the given
4. None of the given

Answer: 1

Chapter No. 4

Question

__________ is a Classical way of problem solving.

1. GA
2. Generate and Test
3. Reasoning
4. None of the given

Answer: 2

Chapter No. 4

Question

The traveling inside a solution space requires something called as __________.

1. Problem Statement
2. Operands
3. Operators
4. Solution Space

Answer: 3

Chapter No. 4

Question

Some essential components of problem solving are Problem statement, ________, Solution space and Operators.

1. Complex State
2. Initial State
3. Intermediate State
4. Goal State

Answer: 4

Chapter No. 4

Question

By getting grips on _________ that deal with searching techniques in graphs and trees, problem solving can be performed in an efficient manner.

1. Pseudocode
2. Algorithms
3. Charts
4. Graphs

Answer: 2

Chapter No. 5

Question

In Optimal Path searches we try to find the _________ solution.

1. Least
2. Best
3. Last but not the Least
4. None of the given

Answer: 2

Chapter No. 5

Question

Most of the solution spaces for problems can be represented in _______.

1. Trees
2. Demos
3. Graphs
4. None of the given

Answer: 3

Chapter No. 5

Question

We use graphs to represent problems and their solution spaces.

1. True
2. False

Answer: 1

Chapter No. 5

Question

Every graph can be converted into a tree.

1. True
2. False

Answer: 1

Chapter No. 5

Question

Most of the solution spaces for problems can be represented in a ___________.

1. Graph
2. Table
3. Demo
4. None of the above

Answer: 1

Chapter No. 5

Question

Procedures that search the solution space in an uninformed manner are usually costly with respect to _________.

1. Time
2. Space
3. Time and space both
4. All of the given

Answer: 3

Chapter No. 6

Question

In DFS, node with the largest value of height will be at Priority ________.

1. Maximum
2. Minimum
3. Zero
4. Least

Answer: 1

Chapter No. 7

Question

In Depth First Search the node with the largest value of height will be at the ___________ priority to be picked.

1. Minimum
2. Maximum
3. Zero
4. Both minimum and maximum

Answer: 2

Chapter No. 7

Question

In Breadth First Search the node with the largest value of height will be at the _________ priority to be picked.

1. Zero
2. Minimum
3. Maximum
4. None of the given

Answer: 3

Chapter No. 7

Question

Breadth-First Search checks all paths of a given length before moving on to any longer paths.

1. True
2. False

Answer: 2

Chapter No. 7

Question

Breadth-first search is a good idea when you are confident that the branching factor is _________.

1. Extremely small
2. Small
3. Medium
4. Large

Answer: 2

Chapter No. 7

Question

The foothill problem occurs whenever there are________ peaks.

1. High
2. Secondary
3. Primary
4. Deep

Answer: 2

Chapter No. 8

Question

Which one of the problems is more subtle, and consequently, is more frustrating?

1. Foothill problem
2. Plateau
3. Ridge
4. Box

Answer: 3

Chapter No. 8

Question

The paths founded by Best First search are likely to be _________ than those found with other methods.

1. Longer
2. Shorter
3. Both of the given
4. None of the given

Answer: 2

Chapter No. 8

Question

Best First Search is a greedy approach.

1. True
2. False

Answer: 1

Chapter No. 8

Question

In Adversarial search there may occur such a scenario where two opponents also called ___________ are searching for a goal.

1. Adversaries
2. Friend
3. Players
4. Intruders

Answer: 1

Chapter No. 9

Question

We can get optimal solution given some parameters using Genetic Algorithm.

1. True
2. False

Answer: 1

Chapter No. 11

Question

Genetic algorithm uses evolutionary techniques, based on function optimization and artificial intelligence, to develop a solution.

1. True
2. False

Answer: 1

Chapter No. 11

Question

In Basic Genetic Algorithm the term mutation refers to a small random ________.

1. Number
2. Change
3. Operator
4. Operand

Answer: 2

Chapter No. 11

Question

Genetic Algorithms is a search method in which multiple search paths are followed in _______.

1. Series
2. Parallel
3. Sequential
4. None of the given

Answer: 2

Chapter No. 11

Question

A function by which we can tell which board position is nearer to our goal is called _________.

1. Alternative function
2. Recursive function
3. Best function
4. Fitness function

Answer: 4

Chapter No. 12

Question

What is the correct order for solving a problem using GA
I. Choose the best individuals from the population for crossover
II. Choose initial population
III. Evaluate the fitness of each individual

1. I,II,III
2. I,III,II
3. II,I,III
4. II,III,I

Answer: 4

Chapter No. 12

Question

Mutation can be as simple as just flipping a bit at random or any number of bits.

1. True
2. False

Answer: 1

Chapter No. 12

Question

In GA, the random process is repeated until an individual with required _________ level is found.

1. Higher
2. Lower
3. Fitness
4. Logical

Answer: 3

Chapter No. 13

Question

A function by which we can tell which board position is nearer to our goal is called.

1. Alternative function
2. Recursive function
3. Best function
4. Fitness function

Answer: 4

Chapter No. 13

Question

An AI system must form a meaningful and useful __________ of the internal information.

1. Representation
2. Execution
3. Learning
4. Planning

Answer: 1

Chapter No. 14

Question

An AI system has a ____________ component that allows the system to get information from its environment.

1. Planning
2. Perception
3. Learning
4. Execution

Answer: 2

Chapter No. 14

Question

In the worst case of semantic network, we may need to traverse the entire network and then discover that the requested info ________.

1. Does not exist
2. Exists
3. Is incorrect
4. Is correct

Answer: 1

Chapter No. 15

Question

A proposition is the statement of a _________.

1. Equation
2. Action
3. Theorem
4. Fact

Answer: 4

Chapter No. 15

Question

Semantic networks are graphs, with nodes representing _________ and arcs representing _________ between objects.

1. distance, relationships
2. objects, distance
3. relationships, distance
4. objects, relationships

Answer: 4

Chapter No. 15

Question

A statement in conjunctive normal form (CNF) consists of _________.

1. ANDs of Ors.
2. ANDs
3. Ors
4. Ors of ANDs

Answer: 1

Chapter No. 16

Question

__________ is the process of deriving logical conclusions from given facts.

1. Representation
2. Execution
3. Reasoning
4. Planning

Answer: 3

Chapter No. 16

Question

In the statement "IF A THEN B", A is called

1. Antecedent
2. Consequent

Answer: 1

Chapter No. 16

Question

__________ reasoning is based on forming, or inducing a ‘generalization’ from a limited set of observations.

1. Deductive
2. Abductive
3. Inductive
4. Analogical

Answer: 3

Chapter No. 16

Question

An ___________ is “A computer program designed to model the problem solving ability of a human expert”.

1. Expert system
2. Intelligent System
3. Echo System
4. Energy System

Answer: 1

Chapter No. 18

Question

Another expert system named __________ was developed by Digital Equipment Corporation, as a computer configuration assistant.

1. R1/XCON
2. MYCIN
3. Dendral
4. R3/XCON

Answer: 1

Chapter No. 18

Question

An expert system may replace the expert or assist the expert.

1. True
2. False

Answer: 1

Chapter No. 18

Question

Conventional programming focuses on _______, while ES programming focuses on ________.

1. Solution, Problem
2. Problem, Solution
3. Problem, Expert
4. Solution, Expert

Answer: 1

Chapter No. 20

Question

In backward chaining terminology, the hypothesis to prove is called the ________.

1. Proof
2. Goal
3. Plan
4. None of the given

Answer: 2

Chapter No. 21

Select a course code for Objective Questions:

ACC501 CS101 CS201 CS301 CS401 CS402 CS403 CS501 CS502 CS504 CS506 CS601 CS604 CS605 CS607 CS609 CS610 CS614 CS707 CS710 ECO401 ECO404 ENG201 ENG301 IT430 MGMT623 MGT101 MGT211 MGT301 MGT401 MGT501 MGT503 MGT510 MGT601 MKT501 MKT630 MTH202 MTH302 PHY301 STA630

Select a course code for Subjective Questions:

ACC311 CS101 CS607 CS701 CS702 CS703 CS704 CS707 CS708 CS710 CS711 CS718 CS721 ENG101 MGT703