The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search

The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search
by

1 Answer

Answer :

(B) Constraint satisfaction
by

Related questions

Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Last Answer : d) All of the mentioned

In constraint satisfaction problem, constraints can be stated as . (A) Arithmatic equations and inequalities that bind the values of variables (B) Arithmatic equations and inequalities that doesn’t bind any restriction over variables (C) Arithmatic equations that impose restrictions over variables (D) Arithmatic equations that discard constraints over the given variables

Description : In constraint satisfaction problem, constraints can be stated as . (A) Arithmatic equations and inequalities that bind the values of variables (B) Arithmatic equations and inequalities ... impose restrictions over variables (D) Arithmatic equations that discard constraints over the given variables

Last Answer : (A) Arithmatic equations and inequalities that bind the values of variables

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

Description : To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

Last Answer : a) Forward Searching

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) D

Description : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D 

Last Answer : Answer: 2

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard

Description : Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard

Last Answer : b) NP complete

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Description : An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Last Answer : (D) Floyd-Warshall algorithm

Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search

Description : Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search

Last Answer : (A) Breadth First Search

Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Description : Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Last Answer : d) All of the mentioned

While a poor physical distribution system would affect all elements of a company's marketing mix, the problems associated with a poor system A)can usually be solved by investing more money in the system. B)are usually caused by increased distribution costs. C)can have a negative impact on customer service and satisfaction. D)are usually attributed to problems with order processing.

Description : While a poor physical distribution system would affect all elements of a company's marketing mix, the problems associated with a poor system A)can usually be solved by investing more money ... impact on customer service and satisfaction. D)are usually attributed to problems with order processing.

Last Answer : C)can have a negative impact on customer service and satisfaction.

What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions (C) It is a chip to map virtual address to physical address (D) It is an algorithm to allocate and deallocate main memory to a process

Description : What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions ... to physical address (D) It is an algorithm to allocate and deallocate main memory to a process 

Last Answer : (C) It is a chip to map virtual address to physical address

Constraint Propagation technique actually modifies the CSP problem. a) True b) False

Description : Constraint Propagation technique actually modifies the CSP problem. a) True b) False

Last Answer : a) True

…………… can be defined as most recent and perhaps the most comprehensive technique for solving computer problems. A) System Analysis B) System Data C) System Procedure D) System Record

Description : …………… can be defined as most recent and perhaps the most comprehensive technique for solving computer problems. A) System Analysis B) System Data C) System Procedure D) System Record

Last Answer : A) System Analysis

Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search

Description : Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search

Last Answer : (D) Depth first search

What is System Analysis? A) The design of the screen the user will see and use to enter or display data B) System analysis defines the format and type of data the program will use C) System Analysis involves creating formal model of the problem to be solved D) None of the above

Description : What is System Analysis? A) The design of the screen the user will see and use to enter or display data B) System analysis defines the format and type of data the program will use C) System Analysis involves creating formal model of the problem to be solved D) None of the above

Last Answer : Answer : C

Drop Table cannot be used to drop a table referenced by a …………… constraint. A) Local Key B) Primary Key C) Composite Key D) Foreign Key

Description : Drop Table cannot be used to drop a table referenced by a …………… constraint. A) Local Key B) Primary Key C) Composite Key D) Foreign Key

Last Answer : D) Foreign Key

. ………………… is a special type of integrity constraint that relates two relations & maintains consistency across the relations. A) Entity Integrity Constraints B) Referential Integrity Constraints

Description : . ………………… is a special type of integrity constraint that relates two relations & maintains consistency across the relations. A) Entity Integrity Constraints B) Referential Integrity Constraints

Last Answer : B) Referential Integrity

The student marks should not be greater than 100. This is (A) Integrity constraint (B) Referential constraint (C) Over-defined constraint (D) Feasible constraint

Description : The student marks should not be greater than 100. This is (A) Integrity constraint (B) Referential constraint (C) Over-defined constraint (D) Feasible constraint

Last Answer : (A) Integrity constraint

Drop Table cannot be used to drop a Table referenced by .................. constraint. (a) Primary key (b) Sub key (c) Super key (d) Foreign key (A) (a) (B) (a), (b) and (c) (C) (d) (D) (a) and (d)

Description : Drop Table cannot be used to drop a Table referenced by .................. constraint. (a) Primary key (b) Sub key (c) Super key (d) Foreign key (A) (a) (B) (a), (b) and (c) (C) (d) (D) (a) and (d)

Last Answer : (C) (d)

In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Description : In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Last Answer : (C) Entity Integrity

Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Description : Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Last Answer : a) Informed search

Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Last Answer : b) Tree algorithm

Which of the following search strategy uses a problem specific knowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search

Description : Which of the following search strategy uses a problem specific knowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search

Last Answer : C : Heuristic Search

Which of the following search strategy uses a problem specificknowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search

Description : Which of the following search strategy uses a problem specificknowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search

Last Answer : C : Heuristic Search

Which of the following search strategy uses a problem specific knowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search

Description : Which of the following search strategy uses a problem specific knowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search

Last Answer : C : Heuristic Search

The following three golden rules: (i) Place the user in control (ii) Reduce the user’s memory load (iii) Make the interface consistent are for (A) User satisfaction (B) Good interface design (C) Saving system’s resources (D) None of these

Description : The following three golden rules: (i) Place the user in control (ii) Reduce the user’s memory load (iii) Make the interface consistent are for (A) User satisfaction (B) Good interface design (C) Saving system’s resources (D) None of these

Last Answer : (B) Good interface design 

In the …………….. traversal we process all of a vertex’s descendents before we move to an adjacent vertex. A) Depth First B) Breadth First C) With First D) Depth Limited

Description : In the …………….. traversal we process all of a vertex’s descendents before we move to an adjacent vertex. A) Depth First B) Breadth First C) With First D) Depth Limited

Last Answer : A) Depth First

Arithmetic mean area can be used in heat transfer problem to calculate the heat flow by conduction through a cylinder which is (A) Thin walled having the value of Ao Ai /< 2 (B) Thick walled (C) Having the value of Ao /Ai > 2 (D) Both (B) and (C)

Description : Arithmetic mean area can be used in heat transfer problem to calculate the heat flow by conduction through a cylinder which is (A) Thin walled having the value of Ao Ai /< 2 (B) Thick walled (C) Having the value of Ao /Ai > 2 (D) Both (B) and (C)

Last Answer : (A) Thin walled having the value of Ao Ai /< 2

Statement of scope and objectives, opportunities and performance criteria …………. A) Problem definition B) System analysis C) System Design D) Documentation

Description : Statement of scope and objectives, opportunities and performance criteria …………. A) Problem definition B) System analysis C) System Design D) Documentation

Last Answer : A) Problem definition

What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search

Description : What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search 

Last Answer : (3) Heuristic Search

Encrypt the plain text Message “EXTRANET” using Transposition cipher technique with the following key: Image Using ‘Z’ as bogus character. (A) TAXERTZENZ (B) EXTRANETZZ (C) EZXZTRZANZET (D) EXTZRANZETZ

Description : Encrypt the plain text Message “EXTRANET” using Transposition cipher technique with the following key: Using ‘Z’ as bogus character. (A) TAXERTZENZ (B) EXTRANETZZ (C) EZXZTRZANZET (D) EXTZRANZETZ

Last Answer : (A) TAXERTZENZ 

What is the problem space of means-end analysis? 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

Description : What is the problem space of means-end analysis? 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

Last Answer : a) An initial state and one or more goal states

Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex binary operation that cannot be solved using neural networks c) Because it can be solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Description : Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex ... solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Last Answer : d) Because it is the simplest linearly inseparable problem that exists.

87. When the staff nurse on duty encounters a problem that cannot be solved using nursing knowledge, skills and available resources, it is best for the nurse to consult the

Description : 87. When the staff nurse on duty encounters a problem that cannot be solved using nursing knowledge, skills and available resources, it is best for the nurse to consult the

Last Answer : C. Head nurse

This set of Artificial Intelligence MCQs focuses on “Neural Networks – 2”. 1. Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex binary operation that cannot be solved using neural networks c) Because it can be solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Description : This set of Artificial Intelligence MCQs focuses on Neural Networks - 2 . 1. Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in ... by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Last Answer : d) Because it is the simplest linearly inseparable problem that exists.

_______________ 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

Description : _______________ 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

Last Answer : a) Constraints Satisfaction Problems

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

Description : 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

Last Answer : b) The entire tree so far been generated must be stored in BFS

Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

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

Description : 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

Last Answer : a) Depth-first search algorithm

Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Last Answer : c) Alpha-beta pruning

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

Description : 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

Last Answer : b) Depth-first search algorithm

A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Description : A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Last Answer : c) Best-First-Search

Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest

Description : Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest

Last Answer : a) Shallowest

Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

Description : Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

Last Answer : b) False

Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Description : Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Last Answer : b) Depth-first search