MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 29 Mcqs, each offering curated multiple-choice questions to sharpen your Artificial Intelligence knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Given below are two statements:Statement I: A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained.Statement II: In nondeterministic environments, agents can apply AND-OR search to generate contingent plans that reach the goal regardless of which outcomes occur during execution.In the light of the above statements, choose the Correct answer from the options given below |
| A. | Both Statement I and Statement II are true |
| B. | Both Statement I and Statement II are false |
| C. | Statement I is correct but Statement II is false |
| D. | Statement I is incorrect but Statement II is true |
| Answer» B. Both Statement I and Statement II are false | |
| 2. |
Idempotency law isI. P Ú P = P.II. P Ù P = P.III. P + P = P. |
| A. | Only (I) above |
| B. | Only (II) above |
| C. | Only (III) above |
| D. | Both (I) and (II) above |
| Answer» B. Only (II) above | |
| 3. |
Knowledge may beI. Declarative.II. Procedural.III. Non-procedural. |
| A. | Only (I) above |
| B. | Only (II) above |
| C. | Only (III) above |
| D. | Both (I) and (II) above |
| Answer» E. | |
| 4. |
An algorithm A is admissible if |
| A. | It is not guaranteed to return an optimal solution when one exists |
| B. | It is guaranteed to return an optimal solution when one exists |
| C. | It returns more solutions, but not an optimal one |
| D. | It guarantees to return more optimal solutions |
| Answer» C. It returns more solutions, but not an optimal one | |
| 5. |
The Newell and Simon program that proved theorems of Principal Mathematical was: |
| A. | Elementary Perceiver |
| B. | General Problem Solver |
| C. | Logic Theorist |
| D. | Boolean Algebra |
| Answer» D. Boolean Algebra | |
| 6. |
ANOTHER_NAME_FOR_1-D_ARRAYS.?$ |
| A. | Linear arrays |
| B. | Lists |
| C. | Horizontal array |
| D. | Vertical array |
| Answer» B. Lists | |
| 7. |
THE_OPERATION_OF_PROCESSING_EACH_ELEMENT_IN_THE_LIST_IS_KNOWN_AS?$ |
| A. | Sorting |
| B. | Merging |
| C. | Inserting |
| D. | Traversal |
| Answer» E. | |
| 8. |
A_data_structure_that_follows_the_FIFO_principle.$ |
| A. | Queue |
| B. | LL |
| C. | Stack |
| D. | Union |
| Answer» D. Union | |
| 9. |
A system wherein items are added from one and removed from the other end? |
| A. | Stack |
| B. | Queue |
| C. | Linked List |
| D. | Array |
| Answer» C. Linked List | |
| 10. |
List obtained in third pass of selection sort for list 3, 5, 4, 1, 2 is __________? |
| A. | 1, 2, 4, 3, 5 |
| B. | 1, 2, 3, 4, 5 |
| C. | 1, 5, 4, 3, 2 |
| D. | 3, 5, 4, 1, 2 |
| Answer» C. 1, 5, 4, 3, 2 | |
| 11. |
An algorithm A is admissible i? |
| A. | It is not guaranteed to return an optimal solution when one exists |
| B. | It is guaranteed to return an optimal solution when one exists |
| C. | It returns more solutions, but not an optimal one |
| D. | It guarantees to return more optimal solutions |
| Answer» C. It returns more solutions, but not an optimal one | |
| 12. |
Any algorithm is a program. |
| A. | True |
| B. | False |
| Answer» C. | |
| 13. |
The Worst case occurs in linear search algorithm when |
| A. | Item is somewhere in the middle of the array |
| B. | Item is not in the array at all |
| C. | Item is the last element in the array |
| D. | Item is the last element in the array or is not there at all |
| Answer» E. | |
| 14. |
The problem space of means-end analysis has |
| A. | An initial state and one or more goal states |
| B. | One or more initial states and one goal state |
| C. | One or more initial states and one or more goal state |
| D. | One initial state and one goal state |
| Answer» B. One or more initial states and one goal state | |
| 15. |
When an algorithm is written in the form of a programming language, it becomes a _________ |
| A. | Flowchart |
| B. | Program |
| C. | Pseudo code |
| D. | Syntax |
| Answer» C. Pseudo code | |
| 16. |
__________ comparisons required to sort the list 1, 2, 3…….n using insertion sort.$ |
| A. | (n<sup>2</sup> + n + 2) / 2 |
| B. | (n<sup>3</sup> + n – 2) / 2 |
| C. | (n<sup>2</sup> + n – 2) / 2 |
| D. | (n<sup>2</sup> – n – 2) / 2 |
| Answer» D. (n<sup>2</sup> ‚Äö√Ñ√∂‚àö√ë‚àö¬® n ‚Äö√Ñ√∂‚àö√ë‚àö¬® 2) / 2 | |
| 17. |
The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is |
| A. | O(n) |
| B. | O(n2) |
| C. | O(n!) |
| D. | O(n/2) |
| Answer» D. O(n/2) | |
| 18. |
To sort a list with n elements, the insertion sort begins with the __________ element. |
| A. | First |
| B. | Second |
| C. | Third |
| D. | Fourth |
| Answer» C. Third | |
| 19. |
What is a heuristic function? |
| A. | A function to solve mathematical problems |
| B. | A function which takes parameters of type string and returns an integer value |
| C. | A function whose return type is nothing |
| D. | A function that maps from problem state descriptions to measures of desirability |
| Answer» E. | |
| 20. |
The time that depends on the input: an already sorted sequence that is easier to sort. |
| A. | Process |
| B. | Evaluation |
| C. | Running |
| D. | Input |
| Answer» D. Input | |
| 21. |
If the entire list is searched sequentially without locating x in linear search, the solution is __________ |
| A. | 0 |
| B. | -1 |
| C. | 1 |
| D. | 2 |
| Answer» B. -1 | |
| 22. |
Which is true regarding BFS (Breadth First Search)? |
| A. | BFS will get trapped exploring a single path |
| B. | The entire tree so far been generated must be stored in BFS |
| C. | BFS is not guaranteed to find a solution, if exists |
| D. | BFS is nothing but Binary First Search |
| Answer» C. BFS is not guaranteed to find a solution, if exists | |
| 23. |
This characteristic often draws the line between what is feasible and what is impossible. |
| A. | Performance |
| B. | System Evaluation |
| C. | Modularity |
| D. | Reliability |
| Answer» B. System Evaluation | |
| 24. |
In ________ search each element is compared with x till not found. |
| A. | Binary |
| B. | Sequential |
| C. | Merge |
| D. | None of the mentioned |
| Answer» C. Merge | |
| 25. |
An algorithm is complete if |
| A. | It terminates with a solution when one exists |
| B. | It starts with a solution |
| C. | It does not terminate with a solution |
| D. | It has a loop |
| Answer» B. It starts with a solution | |
| 26. |
In computer science, algorithm refers to a special method usable by a computer for the solution to a problem. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 27. |
Out of following which property algorithms does not share? |
| A. | Input |
| B. | Finiteness |
| C. | Generality |
| D. | Constancy |
| Answer» E. | |
| 28. |
What is the goal of artificial intelligence? |
| A. | To solve real-world problems |
| B. | To solve artificial problems |
| C. | To explain various sorts of intelligence |
| D. | To extract scientific causes |
| Answer» D. To extract scientific causes | |
| 29. |
What is a Cybernetics? |
| A. | Study of communication between two machines |
| B. | Study of communication between human and machine |
| C. | Study of communication between two humans |
| D. | Study of Boolean values |
| Answer» C. Study of communication between two humans | |