Which search method takes less memory? (A) Depth-First Search (B) Breadth-First search (C) Both (A) and (B) (D) Linear Search

Which search method takes less memory?
(A) Depth-First Search (B) Breadth-First search (C) Both (A) and (B) (D) Linear Search
by

1 Answer

Answer :

(A) Depth-First Search
by

Related questions

Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search

Last Answer : a) Depth-First Search

Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search

Last Answer : a) Depth-First Search

A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Description : A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Last Answer : A : Best-First-Search

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

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

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

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

Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Description : Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Last Answer : b) Breadth-first search

Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Description : Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Last Answer : b) Online search

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

Which of the following is NOT a factor used to classify wholesalers? A)Whether the wholesaler is owned by the producer B)Whether the wholesaler takes title to the products it handles C)The range of services offered by the wholesaler D)The price range of the products carried by the wholesaler E)The breadth and depth of the product lines carried by the wholesaler

Description : Which of the following is NOT a factor used to classify wholesalers? A)Whether the wholesaler is owned by the producer B)Whether the wholesaler takes title to the products it handles C)The ... products carried by the wholesaler E)The breadth and depth of the product lines carried by the wholesaler

Last Answer : D)The price range of the products carried by the wholesale

For a ribbed slab (A) Clear spacing between ribs shall not be greater than 4.5 cm (B) Width of the rib shall not be less than 7.5 cm (C) Overall depth of the slab shall not exceed four times the breadth of the rib (D) All the above

Description : For a ribbed slab (A) Clear spacing between ribs shall not be greater than 4.5 cm (B) Width of the rib shall not be less than 7.5 cm (C) Overall depth of the slab shall not exceed four times the breadth of the rib (D) All the above

Last Answer : Answer: Option D

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

When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal

Description : When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal

Last Answer : b) When all step costs are equal

Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

Description : Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Recursive best-first search

Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Last Answer : d) Unify algorithm

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

If the length of a rectangle is decreased by 3 units and breadth increased by 4 unit, then the area will increase by 9 sq. units. Represent this situation as a linear equation in two variables. -Maths 9th

Description : If the length of a rectangle is decreased by 3 units and breadth increased by 4 unit, then the area will increase by 9 sq. units. Represent this situation as a linear equation in two variables. -Maths 9th

Last Answer : Solution :-

Is it better to go for depth or breadth in your studies?

Description : Is it better to go for depth or breadth in your studies?

Last Answer : Depends what you want to do. Or more specifically, if you know what you want to do. For example, if you're going to become a software engineer (like me), not a person on the planet having ... to change careers at some point, get yourself at least familiar with as many interesting topics as you can.

What is that which, supposing it's greatest breadth to be four inches, length nine inches, and depth three inches and contains a solid foot? -Riddles

Description : What is that which, supposing it's greatest breadth to be four inches, length nine inches, and depth three inches and contains a solid foot? -Riddles

Last Answer : A shoe.

The capacity of a cuboidal tank is 50000 litres of water. Find the breadth of the tank, if its length and depth are respectively 2.5 m and 10 m -Maths 9th

Description : The capacity of a cuboidal tank is 50000 litres of water. Find the breadth of the tank, if its length and depth are respectively 2.5 m and 10 m -Maths 9th

Last Answer : Length (l) and depth (h) of tank is 2.5 m and 10 m respectively. To find: The value of breadth, say b. Formula to find the volume of a tank = l b h = (2.5 b 10) m3= 25b m3 Capacity ... of water (Given) Therefore, 25000 b = 50000 This implies, b = 2 Therefore, the breadth of the tank is 2 m.

River erosion is at its greatest where river's – (1) depth is more (2) breadth is more (3) flow is fast (4) gradient is more

Description : River erosion is at its greatest where river's – (1) depth is more (2) breadth is more (3) flow is fast (4) gradient is more

Last Answer : (3) flow is fast Explanation: The outer bank (called a cut bank) has the greatest erosion because the water is flowing faster along the outer bank than the inner bank. The slower water allows sediment to be deposited (called a point bar).

If L, B and D length, breadth and depth of water in a rectangular sedimentation tank of total discharge Q, the settling velocity, is (A) Q/H(B) Q/D(C) Q/(D × B) (D) Q/(L × B)

Description : If L, B and D length, breadth and depth of water in a rectangular sedimentation tank of total  discharge Q, the settling velocity, is  (A) Q/H (B) Q/D (C) Q/(D × B)  (D) Q/(L × B) 

Last Answer : (D) Q/(L × B) 

A simply supported uniform rectangular bar breadth b, depth d and length L carries an isolated load W at its mid-span. The same bar experiences an extension e under same tensile load. The ratio of the maximum deflection to the elongation, is (A) L/d (B) L/2d (C) (L/2d)² (D) (L/3d)²

Description : A simply supported uniform rectangular bar breadth b, depth d and length L carries an isolated  load W at its mid-span. The same bar experiences an extension e under same tensile load. The  ratio of the maximum deflection to the ... (A) L/d (B) L/2d (C) (L/2d)² (D) (L/3d)²

Last Answer : (C) (L/2d)

The ratio of the breadth to effective depth of a beam is kept (A) 0.25 (B) 0.50 (C) 0.70 (D) 0.75

Description : The ratio of the breadth to effective depth of a beam is kept (A) 0.25 (B) 0.50 (C) 0.70 (D) 0.75

Last Answer : Answer: Option B

A singly reinforced beam has breadth b, effective depth d, depth of neutral axis n and critical neutral axis n1. If fc and ft are permissible compressive and tensile stresses, the moment to resistance of the beam, is (A) bn (fc /2) (d - n/3) (B) Atft (d - n/3) (C) ½ n1 (1 - n1/3) cbd² (D) All the above

Description : A singly reinforced beam has breadth b, effective depth d, depth of neutral axis n and critical neutral axis n1. If fc and ft are permissible compressive and tensile stresses, the moment to resistance of the beam, is (A) bn (fc ... (B) Atft (d - n/3) (C) ½ n1 (1 - n1/3) cbd² (D) All the above

Last Answer : Answer: Option D

The discharge through a channel of rectangular section will be maximum, if (A) Its depth is twice the breadth (B) Its breadth is twice the depth (C) Its depth is thrice the breadth (D) Its breadth is thrice the depth

Description : The discharge through a channel of rectangular section will be maximum, if (A) Its depth is twice the breadth (B) Its breadth is twice the depth (C) Its depth is thrice the breadth (D) Its breadth is thrice the depth

Last Answer : Answer: Option B

The most economical section of a trapezoidal channel is one which has hydraulic mean depth equal to (A) 1/2 × depth (B) 1/2 × breadth (C) 1/2 × sloping side (D) 1/4 × (depth + breadth)

Description : The most economical section of a trapezoidal channel is one which has hydraulic mean depth equal to (A) 1/2 × depth (B) 1/2 × breadth (C) 1/2 × sloping side (D) 1/4 × (depth + breadth)

Last Answer : Answer: Option A

The most economical section of a rectangular channel is one which has hydraulic mean depth or hydraulic radius equal to (A) Half the depth (B) Half the breadth (C) Twice the depth (D) Twice the breadth

Description : The most economical section of a rectangular channel is one which has hydraulic mean depth or hydraulic radius equal to (A) Half the depth (B) Half the breadth (C) Twice the depth (D) Twice the breadth

Last Answer : Answer: Option A

A queen closer is a (A) Brick laid with its length parallel to the face or direction of wall (B) Brick laid with its breadth parallel to the face or direction of wall (C) Brick having the same length and depth as the other bricks but half the breadth (D) Brick with half the width at one end and full width at the other

Description : A queen closer is a (A) Brick laid with its length parallel to the face or direction of wall (B) Brick laid with its breadth parallel to the face or direction of wall (C) Brick having the same ... bricks but half the breadth (D) Brick with half the width at one end and full width at the other

Last Answer : Answer: Option C

In a T-beam, the vertical distance between the bottom of the flange and the centre of the tensile reinforcement is (a) Breadth of flange (b) Thickness of flange (c) Breadth of slab (d) Depth of rib

Description : In a T-beam, the vertical distance between the bottom of the flange and the centre of the tensile reinforcement is (a) Breadth of flange (b) Thickness of flange (c) Breadth of slab (d) Depth of rib

Last Answer : (d) Depth of rib

The breadth of rib in a T-beam should at least be equal to __________the depth of rib (a) One –half (b) One –third (c) One-fourth (d) One –sixth

Description : The breadth of rib in a T-beam should at least be equal to __________the depth of rib (a) One –half (b) One –third (c) One-fourth (d) One –sixth

Last Answer : (b) One –third

The breadth of the flange of a T-beam is (a) 1/3rd of the effective span of the T-beam (b) Twelve times the depth of slab plus breadth of rib. (c) Centre to centre distance between the adjacent beam. (d) Least of (a) , (b) or (c)

Description : The breadth of the flange of a T-beam is (a) 1/3rd of the effective span of the T-beam (b) Twelve times the depth of slab plus breadth of rib. (c) Centre to centre distance between the adjacent beam. (d) Least of (a) , (b) or (c)

Last Answer : (d) Least of (a) , (b) or (c)

The portion of the slab which acts monolithically with the beam and which resists the compressive stresses, is called _________of flange of the T-beam (a) Length (b) Breadth (c) Thickness (d) Depth

Description : The portion of the slab which acts monolithically with the beam and which resists the compressive stresses, is called _________of flange of the T-beam (a) Length (b) Breadth (c) Thickness (d) Depth

Last Answer : (b) Breadth

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

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

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

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

Last Answer : (B) Constraint satisfaction

Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

Description : Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

Last Answer : c) Metalevel state space