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

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
by

1 Answer

Answer :

(C) Dynamic programming principle can be used to discard redundant partial paths.
by

Related questions

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

Description : 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 ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Last Answer : (C) h* underestimates h

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

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.

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) 

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)

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

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

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

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit heap dynamic (iv) All objects in JAVA Codes: (a) (b) (c) (d) (A) (i) (iii) (iv) (ii) (B) (iv) (i) (iii) (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)

Description : Match the following types of variables with the corresponding programming languages: (a) Static variables (i) Local variables in Pascal (b) Stack dynamic (ii) All variables in APL (c) Explicit heap dynamic (iii) Fortran 77 (d) Implicit ... (ii) (C) (iii) (i) (iv) (ii) (D) (ii) (i) (iii) (iv)

Last Answer : (C) (iii) (i) (iv) (ii) 

Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Description : Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Last Answer : 3

52. If an iso-profit yielding the optimal solution coincides with a constraint line, then a. The solution is unbounded b. The solution is infeasible c. The constraint which coincides is redundant d. None of the above

Description : 52. If an iso-profit yielding the optimal solution coincides with a constraint line, then a. The solution is unbounded b. The solution is infeasible c. The constraint which coincides is redundant d. None of the above

Last Answer : d. None of the above

Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Description : Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Last Answer : Answer: 2

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

Which of the following is not a congestion policy at network layer? (A) Flow Control Policy (B) Packet Discard Policy (C) Packet Lifetime Management Policy (D) Routing Algorithm

Description : Which of the following is not a congestion policy at network layer? (A) Flow Control Policy (B) Packet Discard Policy (C) Packet Lifetime Management Policy (D) Routing Algorithm

Last Answer : (A) Flow Control Policy

A linear programm A linear programming model CANNOT be used when whic ing model CANNOT be used when which of the followin h of the following are true? g are true? a)An optimal production plan is desired b)The values of decision variables are fractional c)A set of linear constraints may be defined d)Cross product relationships exist between two or more decision variables

Description : A linear programm A linear programming model CANNOT be used when whic ing model CANNOT be used when which of the followin h of the following are true? g are true? a)An optimal ... set of linear constraints may be defined d)Cross product relationships exist between two or more decision variables

Last Answer : d)Cross product relationships exist between two or more decision variables

Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Last Answer : (2) O(log n) 

Which one from the following is false ? (A) LALR parser is Bottom - Up parser (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1). (C) LR parser is Bottom - Up parser. (D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.

Description : Which one from the following is false ? (A) LALR parser is Bottom - Up parser (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1). (C) LR parser is Bottom - Up parser. (D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.

Last Answer : (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1).

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Last Answer : Answer: 3

........................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

Which of the following statements is correct? (A) Aggregation is a strong type of association between two classes with full ownership. (B) Aggregation is a strong type of association between two classes with partial ownership. (C) Aggregation is a weak type of association between two classes with partial ownership. (D) Aggregation is a weak type of association between two classes with full ownership.

Description : Which of the following statements is correct? (A) Aggregation is a strong type of association between two classes with full ownership. (B) Aggregation is a strong type of association between two ... ownership. (D) Aggregation is a weak type of association between two classes with full ownership.

Last Answer : (C) Aggregation is a weak type of association between two classes with partial ownership.

Find condition is true for food web a) A food web only follows just one path c) A food web starts with a consumer b) A food web ends with a producer d) A food web shoes many paths plants and animals connected

Description : Find condition is true for food web a) A food web only follows just one path c) A food web starts with a consumer b) A food web ends with a producer d) A food web shoes many paths plants and animals connected

Last Answer : A food web shoes many paths plants and animals connected

A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Description : A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Last Answer : A) vertices, edges

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

Which of the following statement(s) is/are true concerning the treatment of MOFS? a. Prevention and therapy of MOFS requires control of the infectious or inflammatory source b. Restoration of normal clinical parameters such as blood pressure, pulse rate, and urine output ensures optimal resuscitation in most patients c. Branch chain amino acids play and important role in the nutritional support of the patient d. Because of the nature of gut injury, total parenteral nutrition is preferred for most patients with MOFS

Description : Which of the following statement(s) is/are true concerning the treatment of MOFS? a. Prevention and therapy of MOFS requires control of the infectious or inflammatory source b. Restoration of normal ... of the nature of gut injury, total parenteral nutrition is preferred for most patients with MOFS

Last Answer : Answer: a, c The therapy of MOFS is directed towards interrupting the involving pathophysiologic process and providing an optimal physiologic environment for healing and recovery. ... Enteral absorption and processing of nutrients appears superior to TPN and lessens overall complications

Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.

Description : Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.

Last Answer : (D) HTML is a programming language.

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

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

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

True statements about chloroquine include: a. is safer than hydroxychloroquine at equivalent dose b. can cause corneal deposition c. causes posterior subcapsular cataract d. chloroquine is bound to the melanin of the retinal pigment epithelium e. causes reversible toxic maculopathy

Description : True statements about chloroquine include: a. is safer than hydroxychloroquine at equivalent dose b. can cause corneal deposition c. causes posterior subcapsular cataract d. chloroquine is bound to the melanin of the retinal pigment epithelium e. causes reversible toxic maculopathy

Last Answer : can cause corneal deposition

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

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

The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Description : The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Last Answer : (3) O(n log log n) 

You are given a set of scales and 12 marbles. The scales are of the old balance variety. That is, a small dish hangs from each end of a rod that is balanced in the middle. The device enables you to conclude either that the contents of the dishes weight the same or that the dish that falls lower has heavier contents than the other. The 12 marbles appear to be identical. In fact, 11 of them are identical, and one is of a different weight. Your task is to identify the unusual marble and discard it. You are allowed to use the scales three times if you wish, but no more. Note that the unusual marble may be heavier or lighter than the others. You are asked to both identify it and determine whether it is heavy or light -Riddles

Description : You are given a set of scales and 12 marbles. The scales are of the old balance variety. That is, a small dish hangs from each end of a rod that is balanced in the middle. The device enables ... than the others. You are asked to both identify it and determine whether it is heavy or light -Riddles

Last Answer : Most people seem to think that the thing to do is weight six coins against six coins, but if you think about it, this would yield you no information concerning the whereabouts of the only different coin. ... . The heavier one is the different coin. If they balance, then 2 is a different light coin.

You are lost in a forest, and you must get home before dark. Whilst walking through the forest, you come across three paths. The first path leads to a lion. The second path leads to a tiger. The third path leads to a jaguar. Which path do you take? -Riddles

Description : You are lost in a forest, and you must get home before dark. Whilst walking through the forest, you come across three paths. The first path leads to a lion. The second path leads to a tiger. The third path leads to a jaguar. Which path do you take? -Riddles

Last Answer : Take the Jaguar, because it's a car.

You walk up to a mountain that has two paths. One leads to the other side of the mountain, and the other will get you lost forever. Two twins know the path that leads to the other side. You can ask them only one question. Except! One lies and one tells the truth, and you don't know which is which. So, What do you ask? -Riddles

Description : You walk up to a mountain that has two paths. One leads to the other side of the mountain, and the other will get you lost forever. Two twins know the path that leads to the other side. You can ask them ... and one tells the truth, and you don't know which is which. So, What do you ask? -Riddles

Last Answer : You ask each twin What would your brother say?. This works because.... Well let's say the correct path is on the left side. So say you asked the liar 'What would your brother say?' Well, ... right, because he knows his brother will lie. Therefore, you would know that the correct path was the left!

The Width of a processor’s data path is measured in bits. Which of the following are common data paths? A) 8 bits B) 12 bits C) 16 bits D) 32 bits

Description : The Width of a processor’s data path is measured in bits. Which of the following are common data paths? A) 8 bits B) 12 bits C) 16 bits D) 32 bits

Last Answer : Answer : A

The critical path A. Is a path that operates from the starting node to the end node B. Is a mixture of all paths. C.Is the longest path D.Is the shortest path

Description : The critical path  A. Is a path that operates from the starting node to the end node  B. Is a mixture of all paths.  C.Is the longest path  D.Is the shortest path

Last Answer : C.Is the longest path

02. A flow in which each liquid particle does not have a definite path and the paths of individual particles also cross each other is called turbulent flow. A) Agree B) Disagree

Description : 02. A flow in which each liquid particle does not have a definite path and the paths of individual particles also cross each other is called turbulent flow. A) Agree B) Disagree

Last Answer : A

A flow in which each liquid particle has a definite path, and the paths of individual particles do not cross each other, is called (A) Steady flow (B) Uniform flow (C) Streamline flow (D) Turbulent flow

Description : A flow in which each liquid particle has a definite path, and the paths of individual particles do not cross each other, is called (A) Steady flow (B) Uniform flow (C) Streamline flow (D) Turbulent flow

Last Answer : Answer: Option C

The flow in which each liquid particle has a definite path and their paths do not cross each other is called (A) One dimensional flow (B) Streamline flow (C) Steady flow (D) Turbulent flow

Description : The flow in which each liquid particle has a definite path and their paths do not cross each other is called (A) One dimensional flow (B) Streamline flow (C) Steady flow (D) Turbulent flow

Last Answer : Answer: Option B

The Width of a processor’s data path is measured in bits. Which of the following are common data paths? a. 8 bits b. 12 bits c. 16 bits d. 32 bits

Description : The Width of a processor’s data path is measured in bits. Which of the following are common data paths? a. 8 bits b. 12 bits c. 16 bits d. 32 bits

Last Answer : a. 8 bits

What is the purpose of making a record of protrusive relation and what function does it serve after it is made? A. To register the condylar path and to adjust the inclination of the incisal guidance. B. To aid in determining the freeway space and to adjust the inclination of the incisal guidance. C. to register the condylar path and to adjust the condylar guides of the articulator so that they are equivalent to the condylar paths of the patient.

Description : What is the purpose of making a record of protrusive relation and what function does it serve after it is made? A. To register the condylar path and to adjust the inclination of the ... the condylar guides of the articulator so that they are equivalent to the condylar paths of the patient.

Last Answer : C. to register the condylar path and to adjust the condylar guides of the articulator so that they are equivalent to the condylar paths of the patient.

The Width of a processor’s data path is measured in bits. Which of the following are common data paths? a. 8 bits b. 12 bits c. 16 bits d. 32 bits

Description : The Width of a processor’s data path is measured in bits. Which of the following are common data paths? a. 8 bits b. 12 bits c. 16 bits d. 32 bits

Last Answer : a. 8 bits

The slot leakage can be calculated by making which of the following assumptions ? (a) The current in the slot conductors is uniformly distributed over their cross-section (b) The leakage path is straight across the slot and around the iron at the bottom (c) The permanence of air paths is only considered. The reluctance of iron paths is assumed as zero (d) All of the above

Description : The slot leakage can be calculated by making which of the following assumptions ? (a) The current in the slot conductors is uniformly distributed over their cross-section (b) The leakage path is straight ... is only considered. The reluctance of iron paths is assumed as zero (d) All of the above

Last Answer : (d) All of the above