MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 103 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
Is ∀z S(x,y) a well-formed formula? |
| A. | yes |
| B. | no |
| Answer» B. no | |
| 52. |
Which of the following is an extension of the semantic network? |
| A. | expert systems |
| B. | rule based expert systems |
| C. | decision tree based networks |
| D. | partitioned networks |
| Answer» E. | |
| 53. |
Is the below statement true for the domain of positive integers ∀p ∃q ( p + q = 7) |
| A. | yes |
| B. | no |
| Answer» B. no | |
| 54. |
Which problem can frequently occur in backward chaining algorithm? |
| A. | repeated states |
| B. | incompleteness |
| C. | complexity |
| D. | both repeated states & incompleteness |
| Answer» E. | |
| 55. |
There exists two way to infer using semantic networks in which knowledge is represented as Frames. |
| A. | intersection search |
| B. | inheritance search |
| Answer» B. inheritance search | |
| 56. |
Which of the following elements constitutes the frame structure? |
| A. | facts or data |
| B. | procedures and default values |
| C. | frame names |
| D. | frame reference in hierarchy |
| Answer» B. procedures and default values | |
| 57. |
The basic inference mechanism in semantic network is to follow the links between the nodes. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 58. |
Graph used to represent semantic network is _____________ |
| A. | undirected graph |
| B. | directed graph |
| C. | directed acyclic graph (dag) |
| D. | directed complete graph |
| Answer» C. directed acyclic graph (dag) | |
| 59. |
What are Semantic Networks? |
| A. | a way of representing knowledge |
| B. | data structure |
| C. | data type |
| D. | none of the mentioned |
| Answer» B. data structure | |
| 60. |
What among the following constitutes the representation of the knowledge in different forms? |
| A. | relational method where each fact is set out systematically in columns |
| B. | inheritable knowledge where relational knowledge is made up of objects |
| C. | inferential knowledge |
| D. | all of the mentioned |
| Answer» E. | |
| 61. |
Which form is called as a conjunction of disjunction of literals? |
| A. | conjunctive normal form |
| B. | disjunctive normal form |
| C. | normal form |
| D. | all of the mentioned |
| Answer» B. disjunctive normal form | |
| 62. |
Choose the correct option. |
| A. | a is true, b is true |
| B. | a is false, b is false |
| C. | a is true, b is false |
| D. | a is false, b is true |
| Answer» B. a is false, b is false | |
| 63. |
What can be viewed as a single lateral of disjunction? |
| A. | multiple clause |
| B. | combine clause |
| C. | unit clause |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 64. |
From which rule does the modus ponens are derived? |
| A. | inference rule |
| B. | module rule |
| C. | both inference & module rule |
| D. | c.none of the mentioned |
| Answer» B. module rule | |
| 65. |
Which is used to compute the truth of any sentence? |
| A. | semantics of propositional logic |
| B. | alpha-beta pruning |
| C. | first-order logic |
| D. | both semantics of propositional logic & alpha-beta pruning |
| Answer» B. alpha-beta pruning | |
| 66. |
First Order Logic is also known as ___________ |
| A. | first order predicate calculus |
| B. | quantification theory |
| C. | lower order calculus |
| D. | all of the mentioned |
| Answer» E. | |
| 67. |
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 |
| Answer» B. false | |
| 68. |
• is evaluated last. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 69. |
A _________ 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 |
| Answer» B. inductive systems | |
| 70. |
What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x)) |
| A. | symmetry |
| B. | exhaustiveness |
| C. | inverse |
| D. | none of the above |
| Answer» D. none of the above | |
| 71. |
The formula or sentences that can be maid true by certain valuation function are called |
| A. | valid formula |
| B. | satisfiable formula |
| C. | unsatisfiable formula |
| D. | invalid formula |
| Answer» C. unsatisfiable formula | |
| 72. |
If a logic produces only true statements and does not produce any false statement it shows which of the following property |
| A. | completeness |
| B. | soundness |
| C. | consistency |
| D. | none of these |
| Answer» C. consistency | |
| 73. |
_________Graph is used to represent semantic network |
| A. | undirected |
| B. | directed |
| C. | undirected |
| D. | any one of the above |
| Answer» C. undirected | |
| 74. |
Is the following rule of inference valid one |
| A. | no |
| B. | yes |
| Answer» C. | |
| 75. |
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. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 76. |
__________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. |
| A. | up-hill search |
| B. | hill-climbing |
| C. | hill algorithm |
| D. | reverse-down-hill search |
| Answer» C. hill algorithm | |
| 77. |
The performance of an agent can be improved by __________ |
| A. | learning |
| B. | observing |
| C. | perceiving |
| D. | sensing |
| Answer» B. observing | |
| 78. |
Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS). |
| A. | bss finds the optimal path while dcbss does not. |
| B. | dcbss finds the optimal path while bss does not. |
| C. | both bss and dcbss find the optimal path |
| D. | neither bss and dcbss find the optimal path |
| Answer» D. neither bss and dcbss find the optimal path | |
| 79. |
Which of the following algorithm is generally used CSP search algorithm? |
| A. | breadth-first search algorithm |
| B. | depth-first search algorithm |
| C. | hill-climbing search algorithm |
| D. | none of the mentioned |
| Answer» C. hill-climbing search algorithm | |
| 80. |
Which of the following conditions must hold for a solution to a CSP? |
| A. | all relations in all constraints must hold |
| B. | at least one relation in all constraints must hold. |
| C. | more than one relation in all constraints must hold. |
| D. | all relations in at least one constraint must hold. |
| Answer» C. more than one relation in all constraints must hold. | |
| 81. |
_______ is/are the well known Expert System/s for medical diagnosis systems |
| A. | mysin |
| B. | caduceus |
| C. | dendral |
| D. | smh.pal |
| Answer» B. caduceus | |
| 82. |
Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)? |
| A. | the boundary is defined as those nodes in closed that have at least one successor still in open |
| B. | the nodes in closed that are not on the boundary are in the kernel |
| C. | the number of relay nodes on each path is exactly one. |
| D. | both a & b |
| Answer» E. | |
| 83. |
Which is the most straightforward approach for planning algorithm? |
| A. | best-first search |
| B. | state-space search |
| C. | depth-first search |
| D. | hill-climbing search |
| Answer» C. depth-first search | |
| 84. |
_____________ is a state that is better than all its neighboring states but is not better than some other states further away |
| A. | plateau |
| B. | local maximum |
| C. | global maximum |
| D. | all of the above |
| Answer» C. global maximum | |
| 85. |
___________ algorithm keeps track of k states rather than just one. |
| A. | hill-climbing search |
| B. | local beam search |
| C. | stochastic hill-climbing search |
| D. | random restart hill-climbing search |
| Answer» C. stochastic hill-climbing search | |
| 86. |
In a rule-based system, procedural domain knowledge is in the form of:___________ |
| A. | production rules |
| B. | rule interpreters |
| C. | meta-rules |
| D. | control rules |
| Answer» B. rule interpreters | |
| 87. |
Which search algorithm imposes a fixed depth limit on nodes? |
| A. | depth-limited search |
| B. | depth-first search |
| C. | iterative deepening search |
| D. | bidirectional search |
| Answer» B. depth-first search | |
| 88. |
STRIPS operators are made up of which three components: |
| A. | p: precondition list , a: add list , d:delete list |
| B. | p: postcondition list , a: add list , d:delete list |
| C. | p: precondition list , s: sub list , d:delete list |
| D. | p: postcondition list , s: sub list , d:delete list |
| Answer» B. p: postcondition list , a: add list , d:delete list | |
| 89. |
In PDDL,the Language is based on _______________________ |
| A. | propositional logic notation |
| B. | second order logic notation |
| C. | first order logic notation |
| D. | all of these |
| Answer» D. all of these | |
| 90. |
PDDL stands for_________________________ |
| A. | path data description language |
| B. | planning domain description language |
| C. | planning data description language |
| D. | path data deleted language |
| Answer» C. planning data description language | |
| 91. |
Frame problem in STRIPS Domain can be solved by _____________________ |
| A. | operator |
| B. | frame aximoms |
| C. | precondition |
| D. | action |
| Answer» C. precondition | |
| 92. |
The output of MATCH routine in Inference Engine is ______________ |
| A. | pattern set |
| B. | conflict set (cs) |
| C. | rule set |
| D. | action set |
| Answer» C. rule set | |
| 93. |
Operator PUTDOWN has which of the following sequence of actions? |
| A. | holding(x),ontable(x),holding(x) |
| B. | holding(x),armempty, holding(x) |
| C. | holding(x),ontable(x) |
| D. | holding(x),ontable(x)^armempty, holding(x) |
| Answer» E. | |
| 94. |
The inference engine goes through which cycle? |
| A. | match-resolve-execute |
| B. | execute-resolve-match |
| C. | resolve match match |
| D. | resolve match execute |
| Answer» B. execute-resolve-match | |
| 95. |
Backtracking is based on ____________ |
| A. | last in first out |
| B. | first in first out |
| C. | recursion |
| D. | both last in first out & recursion |
| Answer» E. | |
| 96. |
Which of the Following problems can be modeled as CSP? |
| A. | 8-puzzle problemb. |
| B. | 8-queen problem |
| C. | map coloring problem |
| D. | all of the mentioned |
| Answer» E. | |
| 97. |
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. |
| A. | constraints satisfaction problems |
| B. | uninformed search problems |
| C. | local search problems |
| D. | all of the mentioned |
| Answer» B. uninformed search problems | |
| 98. |
The __________algorithm explores the domain in a depth first manner. |
| A. | backtracking |
| B. | forward checking |
| C. | arc consistency |
| D. | strategic retreat |
| Answer» B. forward checking | |
| 99. |
If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________ |
| A. | arc consistent |
| B. | i- consistent |
| C. | path consistent. |
| D. | 2- consistent |
| Answer» D. 2- consistent | |
| 100. |
Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed |
| A. | (+,-,+) |
| B. | (-,+,-) |
| C. | (â†,+,â†) |
| D. | (â†,â†,â†) |
| Answer» E. | |