If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if (A) h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if (A) h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these
by

1 Answer

Answer :

(C) h* underestimates h
by

Related questions

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 true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can’t cause right path to be overlooked. (C) Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.

A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

Description : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

Last Answer : a) True

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Last Answer : (D) (a), (b) , (c) and (d)

Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost

Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost

Last Answer : c) Estimated cost of cheapest path from root to goal node

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Last Answer : a) True

In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1

Description : In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1

Last Answer : (A) rows or columns

A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Last Answer : a) True

At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution

Description : At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution

Last Answer : (C) Alternative solution

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

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

Last Answer : b) It is guaranteed to return an optimal solution when one exists

A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext

Description : A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext

Last Answer : C. Hypertext

For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Description : For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Last Answer : (D) O(th)

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Description : If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Last Answer : a) Insertion sort

Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ? (A) not(G):– !, call(G), fail. not(G). (B) not(G):– call(G), !, fail. not(G). (C) not(G):– call(G), fail, !. not(G). (D) not(G):– call(G), fail. not(G):– !.

Description : Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ? (A) not(G):– !, call(G), fail. not(G). (B) not(G):– call(G), !, fail. not(G). (C) not(G):– call(G), fail, !. not(G). (D) not(G):– call(G), fail. not(G):– !.

Last Answer : (B) not(G):– call(G), !, fail. not(G).

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

Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/ are correct? (A) (a) only (B) (b) only (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map ... (b) only (C) (a) and (b) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c) 

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Last Answer : (C) (n-1)/2

Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Description : Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Last Answer : (A) BUTAEEZ

Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Last Answer :  (D) m + n – 1

………………. Is a directed tree in which outdegree of each node is less than or equal to two. A) Unary tree B) Binary tree C) Dinary tree D) Both B and C

Description : ………………. Is a directed tree in which outdegree of each node is less than or equal to two. A) Unary tree B) Binary tree C) Dinary tree D) Both B and C

Last Answer : B) Binary tree

................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Last Answer : (C) Alpha-beta pruning procedure

Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search

Description : Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search

Last Answer : d) A* search

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Last Answer : (D) 9, 10

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Description : Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d

Last Answer : If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

51. An iso-profit line represents a. An infinite number of solutions all of which yield the same profit b. An infinite number of solutions all of which incurs the same cost c. An infinite number of optimal solutions d. A boundary of the feasible region

Description : 51. An iso-profit line represents a. An infinite number of solutions all of which yield the same profit b. An infinite number of solutions all of which incurs the same cost c. An infinite number of optimal solutions d. A boundary of the feasible region

Last Answer : . An infinite number of solutions all of which yield the same profit

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1 The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is :  1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Last Answer : (B) 10 and 7

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

Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40

Description : Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is (1) 20 (2) 10 (3) 30 (4) 40

Last Answer : (2) 10

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

A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming

Description : A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming

Last Answer : a) Feed-forward neural network

When does apparent authority of an agent arise? a. When the acts with the usual authority of the job b. When the principal gives the agent implied authority to act c. When the agent has actual authority to act d. When the principal represents to a third party that an agent has the authority to act when in fact he doesn’t

Description : When does apparent authority of an agent arise? a. When the acts with the usual authority of the job b. When the principal gives the agent implied authority to act c. When the agent has actual authority ... represents to a third party that an agent has the authority to act when in fact he doesn't

Last Answer : d. When the principal represents to a third party that an agent has the authority to act when in fact he doesn’t

Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Last Answer : c) The one closest to the goal node

what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node

Description : what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node

Last Answer : D : Estimated cost of cheapest path from root to goal node

what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node

Description : what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node

Last Answer : D : Estimated cost of cheapest path from root to goal node

what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node

Description : what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node

Last Answer : D : Estimated cost of cheapest path from root to goal node

what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node

Description : what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node

Last Answer : D : Estimated cost of cheapest path from root to goal node

Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a fact or rule A to get Clause C then C has positive literal and non null-goal. (D) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.

Description : Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a ... negated goal G against a fact or rule A to get clause C then C has positive literal or null goal. 

Last Answer : (B) The resolvent of two Horn clauses is a Horn Clause.

The budgeted cost for all the activities in a project with the help of Earned Value Method is A. Actual Cost B. Budget at completion C. Budget for completion D. Estimate at completion

Description : The budgeted cost for all the activities in a project with the help of Earned Value  Method is  A. Actual Cost  B. Budget at completion  C. Budget for completion  D. Estimate at completion

Last Answer : D. Estimate at completion

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Last Answer : (A) less than 1

The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Last Answer : Answer: D

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Last Answer : Answer: 1

........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. a. Goal programming b. Linear programming c. Decision making d. None of these

Description : ........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. a. Goal programming b. Linear programming c. Decision making d. None of these

Last Answer : b. Linear programming

A software project was estimated at 352 Function Points (FP). A four person team will be assigned to this project consisting of an architect, two programmers, and a tester. The salary of the architect is Rs.80,000 per month, the programmer Rs.60,000 per month and the tester Rs.50,000 per month. The average productivity for the team is 8 FP per person month. Which of the following represents the projected cost of the project? (1) Rs.28,16,000 (2) Rs.20,90,000 (3) Rs.26,95,000 (4) Rs.27,50,000

Description : A software project was estimated at 352 Function Points (FP). A four person team will be assigned to this project consisting of an architect, two programmers, and a tester. The salary of the architect is Rs.80,000 per month, the ... ) Rs.28,16,000 (2) Rs.20,90,000 (3) Rs.26,95,000 (4) Rs.27,50,000

Last Answer : (4) Rs.27,50,000 

What describes a process of continuously measuring results and comparing those results to optimal performance so that actual performance may be improved? a. Performance b. Capacity planning c. Benchmarking d. Data cleansing

Description : What describes a process of continuously measuring results and comparing those results to optimal performance so that actual performance may be improved? a. Performance b. Capacity planning c. Benchmarking d. Data cleansing

Last Answer : c. Benchmarking