Artificial Intelligence And Robotics Set 2
On This Page
This set of Artificial Intelligence and Robotics AIR Multiple Choice Questions & Answers (MCQs) focuses on Artificial Intelligence And Robotics Set 2
Q1 | Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).
- bss finds the optimal path while dcbss does not.
- dcbss finds the optimal path while bss does not.
- both bss and dcbss find the optimal path
- neither bss and dcbss find the optimal path
Q2 | The performance of an agent can be improved by __________
- learning
- observing
- perceiving
- sensing
Q3 | __________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.
- up-hill search
- hill-climbing
- hill algorithm
- reverse-down-hill search
Q4 | Not only do formal logics allow representation of knowledge, but they also allow representation of knowledge Mechanisms for reasoning using a collection of well-defined manipulation rules Of Representations.
- true
- false
Q5 | If a logic produces only true statements and does not produce any false statement it shows which of the following property
- completeness
- soundness
- consistency
- none of these
Q6 | Is the following rule of inference valid one
- no
- yes
Q7 | _________Graph is used to represent semantic network
- undirected
- directed
- undirected
- any one of the above
Q8 | What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x))
- symmetry
- exhaustiveness
- inverse
- none of the above
Q9 | The formula or sentences that can be maid true by certain valuation function are called
- valid formula
- satisfiable formula
- unsatisfiable formula
- invalid formula
Q10 | A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula.
- deductive systems
- inductive systems
- reasoning with knowledge based systems
- search based systems
Q11 | • is evaluated last.
- true
- false
Q12 | 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).
- true
- false
Q13 | First Order Logic is also known as ___________
- first order predicate calculus
- quantification theory
- lower order calculus
- all of the mentioned
Q14 | Which is used to compute the truth of any sentence?
- semantics of propositional logic
- alpha-beta pruning
- first-order logic
- both semantics of propositional logic & alpha-beta pruning
Q15 | From which rule does the modus ponens are derived?
- inference rule
- module rule
- both inference & module rule
- c.none of the mentioned
Q16 | Which form is called as a conjunction of disjunction of literals?
- conjunctive normal form
- disjunctive normal form
- normal form
- all of the mentioned
Q17 | What can be viewed as a single lateral of disjunction?
- multiple clause
- combine clause
- unit clause
- none of the mentioned
Q18 | Choose the correct option.
- a is true, b is true
- a is false, b is false
- a is true, b is false
- a is false, b is true
Q19 | What among the following constitutes the representation of the knowledge in different forms?
- relational method where each fact is set out systematically in columns
- inheritable knowledge where relational knowledge is made up of objects
- inferential knowledge
- all of the mentioned
Q20 | What are Semantic Networks?
- a way of representing knowledge
- data structure
- data type
- none of the mentioned
Q21 | Graph used to represent semantic network is _____________
- undirected graph
- directed graph
- directed acyclic graph (dag)
- directed complete graph
Q22 | The basic inference mechanism in semantic network is to follow the links between the nodes.
- true
- false
Q23 | Which of the following elements constitutes the frame structure?
- facts or data
- procedures and default values
- frame names
- frame reference in hierarchy
Q24 | There exists two way to infer using semantic networks in which knowledge is represented as Frames.
- intersection search
- inheritance search
Q25 | Which problem can frequently occur in backward chaining algorithm?
- repeated states
- incompleteness
- complexity
- both repeated states & incompleteness