# Computer/Artificial Intelligence and Robotics (AIR) Set 1 Sample Test,Sample questions

## Question: ` Backtracking is based on ____________`

1. last in first out

2.first in first out

3.recursion

4.both last in first out & recursion

## Question: ` First Order Logic is also known as ___________`

1. first order predicate calculus

2.quantification theory

3.lower order calculus

4.all of the mentioned

1.operator

2.frame aximoms

3.precondition

4.action

1.completeness

2.soundness

3.consistency

4.None of These

## Question: ` If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be ___________`

1.arc consistent

2.i- consistent

3.path consistent.

4.2- consistent

## Question: ` In a rule-based system, procedural domain knowledge is in the form of:____`

1. production rules

2.rule interpreters

3.meta-rules

4.control rules

1. i. and ii.

2. i. and i

3. ii. and iii.

4. iii. and iv.

## Question: ` The statement comprising the limitations of FOL is/are ____________`

1.expressiveness

2.formalizing natural languages

3.many-sorted logic

4.all of the mentioned

## Question: ` There exists two way to infer using semantic networks in which knowledge is represented as Frames.`

1. intersection search

2. inheritance search

3.both (a) and (b)

4.None of these

## Question: ` What can be viewed as a single lateral of disjunction?`

1.multiple clause

2.combine clause

3.unit clause

4.None of the mentioned

## Question: ` What is the nature of the sentence: âˆ€x âˆ€y (TeacherOf(x,y) âŠƒ StudentOf(y,x))`

1.symmetry

2.exhaustiveness

3.inverse

4.None of the above

## Question: ` Which of the following algorithm is generally used CSP search algorithm?`

2.depth-first search algorithm

3.hill-climbing search algorithm

4.None of the above

## Question: ` Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).`

1. bss finds the optimal path while dcbss does not. B. C. D.

2.both bss and dcbss find the optimal path

3.both bss and dcbss find the optimal path

4. neither bss and dcbss find the optimal path

1.(+,-,+)

2.(-,+,-)

3.(â†,+,â†)

4.(â†,â†,â†)

## Question: ` Which of the following conditions must hold for a solution to a CSP?`

1.all relations in all constraints must hold

2.at least one relation in all constraints must hold.

3.more than one relation in all constraints must hold.

4. all relations in at least one constraint must hold

## Question: ` Which of the following is a sound rule of inference?`

1.q âˆ§ (p â†’ q) â†’ p

2.p â†’ (p âˆ¨ q)

3.q âˆ¨ (p â†’ q) â†’ p

4.all of above

## Question: ` Which of the Following problems can be modeled as CSP?`

1.8-puzzle problemb.

2.8-queen problem

3.map coloring problem

4. all of the mentioned

## Question: ` Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?`

1. the boundary is defined as those nodes in closed that have at least one successor still in open

2.the nodes in closed that are not on the boundary are in the kernel

3.the number of relay nodes on each path is exactly one

4.both a & b discuss D.both a & b

## Question: ` Which search algorithm imposes a fixed depth limit on nodes?`

1.depth-limited search

2.depth-first search

3.iterative deepening search

4. bidirectional search

## Question: `A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula.`

1.deductive systems

2.inductive systems

3.reasoning with knowledge based systems

4.search based systems

## Question: `â€¢ is evaluated last.`

1.deductive systems

2.inductive systems

3.reasoning with knowledge based systems

4.search based systems

## Question: `Choose the correct option.`

1.a is true, b is true

2.a is false, b is false

3.a is true, b is false

4.a is false, b is true

## Question: `From which rule does the modus ponens are derived?`

1.inference rule

2.module rule

3.both inference & module rule

4.c.none of the mentioned

## Question: `Graph used to represent semantic network is ______`

1.undirected graph

2.directed graph

3.directed acyclic graph (dag)

4.directed complete graph

## Question: `In PDDL,the Language is based on ________`

1.propositional logic notation B

2.second order logic notation

3.first order logic notation

4.All of the above

## Question: `Operator PUTDOWN has which of the following sequence of actions?`

1.holding(x),ontable(x),holding(x)

2.holding(x),armempty, holding(x)

3.holding(x),ontable(x)

4. holding(x),ontable(x)^armempty, holding(x)

## Question: `PDDL stands for_____________________`

1.path data description language B.

2.planning domain description language

3. planning data description language

4.path data deleted language

## Question: `STRIPS operators are made up of which three components:`

1.p: precondition list , a: add list , d:delete list

2.p: postcondition list , a: add list , d:delete list

3.p: precondition list , s: sub list , d:delete list

4.p: postcondition list , s: sub list , d:delete list

## Question: `STRIPS operators are made up of which three components:`

1.p: precondition list , a: add list , d:delete list

2.p: postcondition list , a: add list , d:delete list

3.p: precondition list , s: sub list , d:delete list

4.p: postcondition list , s: sub list , d:delete list

## Question: `The formula or sentences that can be maid true by certain valuation function are called`

1.valid formula

2.satisfiable formula

3.unsatisfiable formula

4.invalid formula

## Question: `The inference engine goes through which cycle?`

1.match-resolve-execute

2.execute-resolve-match

3.resolve match match

4.resolve match execute

## Question: `The output of MATCH routine in Inference Engine is ______`

1.pattern set

2.conflict set (cs)

3.rule set

4.action set

1.learning

2.observing

3.perceiving

4.sensing

## Question: `The working memory of the problem solver is like its _________________`

1.long term memory

2.short term memory

3.permanent memory

4. none of these

## Question: ```The __________algorithm explores the domain in a depth first manner. ```

1.backtracking

2.forward checking

3.arc consistency

4.strategic retreat

## Question: `What among the following constitutes the representation of the knowledge in different forms?`

1.relational method where each fact is set out systematically in columns

2.inheritable knowledge where relational knowledge is made up of objects

3.inferential knowledge

4.All of the mentioned

## Question: `What are Semantic Networks?`

1.a way of representing knowledge

2.data structure

3.data type

4.none of the mentioned

## Question: `Which form is called as a conjunction of disjunction of literals?`

1. conjunctive normal form

2.disjunctive normal form

3.normal form

4.all of the mentioned

## Question: `Which is the most straightforward approach for planning algorithm?`

1.best-first search

2. state-space search

3.depth-first search

4.hill-climbing search

## Question: `Which is used to compute the truth of any sentence?`

1.semantics of propositional logic

2.alpha-beta pruning

3.first-order logic

4.both semantics of propositional logic & alpha-beta pruning

## Question: `Which of the following elements constitutes the frame structure?`

1.facts or data

2. procedures and default values

3. frame names

4.frame reference in hierarchy

## Question: `Which of the following is an extension of the semantic network?`

1.expert systems

2.rule based expert systems

3.decision tree based networks

4.partitioned networks

## Question: `Which problem can frequently occur in backward chaining algorithm?`

1.repeated states

2.incompleteness

3.complexity

4.both repeated states & incompleteness

1.mysin

3.dendral

4.smh.pal

## Question: `____Graph is used to represent semantic network`

1.undirected

2.directed

3.undirected

4.any one of the above

## Question: `____search regresses over goals and validate a plan before returning it.`

1. forward state space

2.backward state space

3.goa stack

4.none of these

## Question: `____search regresses over goals and validate a plan before returning it.`

1. forward state space

2.backward state space

3.goa stack

4.none of these

## Question: ```_______ algorithm keeps track of k states rather than just one. ```

1.hill-climbing search

2.local beam search

3.stochastic hill-climbing search

4.random restart hill-climbing search

## Question: ```_______ Is an algorithm, a loop that continually moves in the direction of increasing value â€“ that is uphill. ```

1.up-hill search

2.hill-climbing

3.hill algorithm

4.reverse-down-hill search

## Question: `___________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.`

1. constraints satisfaction problems

2. uninformed search problems

3. local search problems

4.all of the mentioned

## More MCQS

##### Olete Team
Online Exam TestTop Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on Online Exam Testwebsite is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!