QUIZ 1 – DCIT 313

Part 1 of 1 - / 79.0 Points

Question 1 of 79 1.0 Points

What is Artificial intelligence?

• A. Putting your intelligence into Computer

• B. Programming with your intelligence

• C. Making a Machine intelligent

• D. Thinking for machines

Question 2 of 79 1.0 Points

Who is known as the Father of AI?

• A. Fisher Ada

• B. Alan Turing

• C. John McCarthy

• D. Allen Newell

Question 3 of 79 1.0 Points

The application/applications of Artificial Intelligence is/are

• A. Expert Systems

• B. Gaming

• C. Vision Systems

• D. All of the above

Question 4 of 79 1.0 Points

A technique that was developed to determine whether a machine could or could not
demonstrate the artificial intelligence known as the___

• A. Boolean Algebra

• B. Turing Test

• C. Logarithm

• D. Algorithm

Question 5 of 79 1.0 Points

An AI agent perceives and acts upon the environment using___.

• A. Sensors

• B. Perceiver

• C. Actuators

• D. Both a and c

Question 6 of 79 1.0 Points

Which rule is applied for the Simple reflex agent?

• A. Simple-action rule

• B. Simple &Condition-action rule

• C. Condition-action rule

• D. None of the above

Question 7 of 79 1.0 Points

Which agent deals with the happy and unhappy state?

• A. Utility-based agent
 • B. Model-based agent

• C. Goal-based Agent

• D. Learning Agent

Question 8 of 79 1.0 Points

A rational agent always does the right things.

• A. True

• B. False

Question 9 of 79 1.0 Points

Which term describes the common sense of the critical part of problem-solving?

• A. Values-based

• B. Critical

• C. Analytical

• D. Heuristic

Question 10 of 79 1.0 Points

Which AI technique enables the computers to understand the associations and relationships
between objects and events?

• A. Heuristic Processing

• B. Cognitive Science

• C. Relative Symbolism

• D. Pattern Matching

Question 11 of 79 1.0 Points

The exploration problem is where______.

• A. Agent contains the knowledge of State and actions.

• B. An agent does not contain the knowledge of the State and its actions.

• C. Only actions are known to the agent.

• D. None of the above

Question 12 of 79 1.0 Points

Which instruments are used for perceiving and acting upon the environment?

• A. Sensors and Actuators

• B. Sensors

• C. Perceiver

• D. None of the mentioned

Question 13 of 79 1.0 Points

What is meant by an agent?s percept sequence?

• A. Used to perceive the environment

• B. Complete history of the actuator

• C. A complete history of perceived things

• D. None of the mentioned

Question 14 of 79 1.0 Points

How many types of agents are there in artificial intelligence?

• A. 1
 • B. 2

• C. 3

• D. 4

Question 15 of 79 1.0 Points

What is the composition of agents in artificial intelligence?

• A. Program

• B. Architecture

• C. Both Program and Architecture

• D. None of the mentioned

Question 16 of 79 1.0 Points

In which agent does the problem generator is present?

• A. Learning agent

• B. Observing agent

• C. Reflex agent

• D. None of the mentioned

Question 17 of 79 1.0 Points

Which is used to improve the agent's performance?

• A. Perceiving

• B. Learning

• C. Observing

• D. None of the mentioned

Question 18 of 79 1.0 Points
Which action sequences are used to achieve the agent's goal?

• A. Search

• B. Plan

• C. Retrieve

• D. Both Search and Plan

Question 19 of 79 1.0 Points

Which element in the agent is used for selecting external actions?

• A. Perceive

• B. Performance

• C. Learning

• D. Actuator

Question 20 of 79 1.0 Points

Which is not the commonly used programming language for AI?

• A. PROLOG

• B. Java

• C. LISP

• D. Perl

Question 21 of 79 1.0 Points

An omniscient agent knows the actual outcome of its actions and can act accordingly, but
omniscience is impossible in reality. Rational Agent always does the right thing, but
Rationality is possible in reality.

• A. True

• B. False

Question 22 of 79 1.0 Points

The Task Environment of an agent consists of ____________

• A. Sensors

• B. Actuators

• C. Performance Measures

• D. All of the mentioned

Question 23 of 79 1.0 Points

What could possibly be the environment of a Satellite Image Analysis System?

• A. Computers in space and earth

• B. Image categorization techniques

• C. Statistical data on image pixel intensity value and histograms

• D. All of the mentioned

Question 24 of 79 1.0 Points

Categorize the Crossword puzzle as Fully Observable / Partially Observable.

• A. Fully Observable

• B. partially Observable
 • C. All of the mentioned

• D. None of the mentioned

Question 25 of 79 1.0 Points

The game of Poker is a single agent.

• A. True

• B. False

Question 26 of 79 1.0 Points

Satellite Image Analysis System (Choose the one that is not applicable).

• A. Episodic

• B. Semi-Static

• C. Single agent

• D. Partially Observable

Question 27 of 79 1.0 Points

An agent is composed of ________

• A. Architecture

• B. Agent Function

• C. Perception Sequence

• D. Architecture and Program

Question 28 of 79 1.0 Points

Which depends on the percepts and actions available to the agent.
 • A. Agent

• B. Sensor

• C. Design problem

• D. None of the mentioned

Question 29 of 79 1.0 Points

Which were built in such a way that humans had to supply the inputs and interpret the
outputs?

• A. Agents

• B. AI system

• C. Sensor

• D. Actuators

Question 30 of 79 1.0 Points

Which technology uses miniaturized accelerometers and gyroscopes?

• A. Sensors

• B. Actuators

• C. MEMS

• D. None of the mentioned

Question 31 of 79 1.0 Points

What is used for tracking uncertain events?

• A. Filtering algorithm

• B. Sensors
 • C. Actuators

• D. None of the mentioned

Question 32 of 79 1.0 Points

Which functions are used as preferences over state history?

• A. Award

• B. Reward

• C. Explicit

• D. Implicit

Question 33 of 79 1.0 Points

Which kind of agent architecture should an agent use?

• A. Relaxed

• B. Logic

• C. Relational

• D. All of the mentioned

Question 34 of 79 1.0 Points

Specify the agent architecture name that is used to capture all kinds of actions.

• A. Complex

• B. Relational

• C. Hybrid

• D. None of the mentioned

Question 35 of 79 1.0 Points
Which agent enables the deliberation about the computational entities and actions?

• A. Hybrid

• B. Reflective

• C. Relational

• D. None of the mentioned

Question 36 of 79 1.0 Points

What can operate over the joint state space?

• A. Decision-making algorithm

• B. Learning algorithm

• C. Complex algorithm

• D. Both Decision-making & Learning algorithm

Question 37 of 79 1.0 Points

The Turing test was invented by Brian Turing.

• A. True

• B. False

Question 38 of 79 1.0 Points

Machine Learning is part of Artificial Intelligence.

• A. True

• B. False
Question 39 of 79 1.0 Points
The first milestone in the history of AI development happened in the year ____.

• A. 1931

• B. 1921

• C. 1941

• D. 1951

Question 40 of 79 1.0 Points

IBM?s chess computer that defeated Gary Kasparov is called

• A. Deep Ocean

• B. Chess Master

• C. Grandmaster

• D. Deep Blue

Question 41 of 79 1.0 Points

There exist only two types of quantifiers, Universal Quantification and Existential
Quantification.

• A. True

• B. False

Question 42 of 79 1.0 Points

Translate the following statement into FOL. For every a, if a is a philosopher, then a is a
scholar?

• A. ? a philosopher(a) scholar(a)

• B. ? a philosopher(a) scholar(a)
 • C. All of the mentioned

• D. None of the mentioned

Question 43 of 79 1.0 Points

_________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical
consequence of another formula.

• A. Deductive Systems

• B. Inductive Systems

• C. Reasoning with Knowledge-Based Systems

• D. Search Based Systems

Question 44 of 79 1.0 Points

A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function
applied to n terms: F(t1 t2 ..tn).

• A. True

• B. False

Question 45 of 79 1.0 Points

First Order Logic is also known as ___________

• A. First Order Predicate Calculus

• B. Quantification Theory

• C. Lower Order Calculus

• D. All of the mentioned

Question 46 of 79 1.0 Points

The adjective "first-order" distinguishes first-order logic from ___________ in which there
are predicates having predicates or functions as arguments, or in which one or both predicate
quantifiers or function quantifiers are permitted.

• A. Representational Verification

• B. Representational Adequacy

• C. Higher Order Logic

• D. Inferential Efficiency

Question 47 of 79 1.0 Points

Which condition is used to cease the growth of forward chaining?

• A. atomic sentences

• B. Complex sentences

• C. No further inference

• D. All of the mentioned

Question 48 of 79 1.0 Points

Which closely resembles a propositional definite clause? .

• A. Resolution

• B. Inference

• C. Conjunction

• D. First-order definite clauses

Question 49 of 79 1.0 Points

What is the condition of variables in first-order literals?
 • A. Existentially quantified

• B. Universally quantified

• C. Both Existentially & Universally quantified

• D. None of the mentioned

Question 50 of 79 1.0 Points

Which are more suitable normal forms to be used with definite clauses?

• A. Positive literal

• B. Negative literal

• C. Generalized modus ponens

• D. Neutral literal

Question 51 of 79 1.0 Points

Which will be the instance of the class datalog knowledge bases?

• A. Variables

• B. No function symbols

• C. First-order definite clauses

• D. None of the mentioned

Question 52 of 79 1.0 Points

Which knowledge base is called a fixed point?

• A. First-order definite clauses are similar to propositional forward chaining

• B. First-order definite clauses are mismatched to propositional forward chaining

 • C. All of the mentioned

• D. None of the mentioned

Question 53 of 79 1.0 Points

How to eliminate the redundant rule-matching attempts in the forward chaining?

• A. Decremental forward chaining

• B. Incremental forward chaining

• C. Data complexity

• D. None of the mentioned

Question 54 of 79 1.0 Points

From where did the new fact inferred on the new iteration is derived? Answer: c

• A. Old fact

• B. Narrow fact

• C. New fact

• D. All of the mentioned

Question 55 of 79 1.0 Points

Which will solve the conjuncts of the rule so that the total cost is minimized?

• A. Constraint variable

• B. Conjunct ordering

• C. Data complexity

• D. All of the mentioned

Question 56 of 79 1.0 Points
How many possible sources of complexity are there in forward chaining?

• A. 1

• B. 2

• C. 3

• D. 4

Question 57 of 79 1.0 Points

Which algorithm will work backward from the goal to solve a problem?

• A. Forward chaining

• B. Backward chaining

• C. Hill-climb algorithm

• D. None of the mentioned

Question 58 of 79 1.0 Points

Which is mainly used for automated reasoning?

• A. Backward chaining

• B. Forward chaining

• C. Logic programming

• D. Parallel programming

Question 59 of 79 1.0 Points

What will backward chaining algorithm return?

• A. Additional statements
 • B. Substitutes matching the query

• C. Logical statement

• D. All of the mentioned

Question 60 of 79 1.0 Points

How can the goal be thought of in backward chaining algorithm?

• A. Queue

• B. List

• C. Vector

• D. Stack

Question 61 of 79 1.0 Points

What is used in backward chaining algorithm?

• A. Conjuncts

• B. Substitution

• C. Composition of substitution

• D. None of the mentioned

Question 62 of 79 1.0 Points

Which algorithm are in more similar to backward chaining algorithm?

• A. Depth-first search algorithm

• B. Breadth-first search algorithm

• C. Hill-climbing search algorithm

• D. All of the mentioned

Question 63 of 79 1.0 Points
Which problem can frequently occur in backward chaining algorithm?

• A. Repeated states

• B. Incompleteness

• C. Complexity

• D. Both Repeated states & Incompleteness

Question 64 of 79 1.0 Points

How can the logic programming can be constructed?

• A. Variables

• B. Expressing knowledge in a formal language

• C. Graph

• D. All of the mentioned

Question 65 of 79 1.0 Points

What form of negation does the prolog allow?

• A. Negation as failure

• B. Proposition

• C. Substitution

• D. Negation as success

Question 66 of 79 1.0 Points

Which is omitted in prolog unification algorithm?
 • A. Variable check

• B. Occur check

• C. Proposition check

• D. Both Occur and Proposition check

Question 67 of 79 1.0 Points

Which is a refutation complete inference procedure for propositional logic?

• A. Clauses

• B. Variables

• C. Propositional resolution

• D. Proposition

Question 68 of 79 1.0 Points

What kind of clauses are available in Conjunctive Normal Form?

• A. Disjunction of literals

• B. Disjunction of variables

• C. Conjunction of literals

• D. Conjunction of variables

Question 69 of 79 1.0 Points

What is the condition of literals in variables?

• A. Existentially quantified

• B. Universally quantified
 • C. Quantified

• D. None of the mentioned

Question 70 of 79 1.0 Points

Which can be converted to inferred equivalent CNF sentence?

• A. Every sentence of propositional logic

• B. Every sentence of inference

• C. Every sentence of first-order logic

• D. All of the mentioned

Question 71 of 79 1.0 Points

Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?

• A. Search statement

• B. Reading statement

• C. Replaced statement

• D. Original statement

Question 72 of 79 1.0 Points

Which rule is equal to the resolution rule of first-order clauses?

• A. Propositional resolution rule

• B. Inference rule

• C. Resolution rule

• D. None of the mentioned

Question 73 of 79 1.0 Points
At which state do the propositional literals are complementary?

• A. If one variable is less

• B. If one is the negation of the other

• C. All of the mentioned

• D. None of the mentioned

Question 74 of 79 1.0 Points

What is meant by factoring?

• A. Removal of redundant variable

• B. Removal of redundant literal

• C. Addition of redundant literal

• D. Addition of redundant variable

Question 75 of 79 1.0 Points

What will happen if two literals are identical?

• A. Remains the same

• B. Added as three

• C. Reduced to one

• D. None of the mentioned

Question 76 of 79 1.0 Points

When the resolution is called refutation-complete?

• A. Sentence is satisfiable
 • B. Sentence is unsatisfiable

• C. Sentence remains the same

• D. None of the mentioned

Question 77 of 79 1.0 Points

Knowledge and reasoning also play a crucial role in dealing with __________________
environment.

• A. Completely Observable

• B. Partially Observable

• C. Neither Completely nor Partially Observable

• D. Only Completely and Partially Observable

Question 78 of 79 1.0 Points

The treatment chosen by a doctor for a patient for a disease is based on _____________

• A. Only current symptoms

• B. Current symptoms plus some knowledge from the textbooks

• C. Current symptoms plus some knowledge from the textbooks plus experience

• D. All of the mentioned

Question 79 of 79 1.0 Points

A knowledge-based agent can combine general knowledge with current percepts to infer
hidden aspects of the current state prior to selecting actions.

• A. True

• B. False