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

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
by

1 Answer

Answer :

A) Depth First
by

Related questions

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

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)

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

……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal

Description : ……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal

Last Answer : D) Traversal

………………. is not an operation performed on linear list Get More Mcqs from http://www.siteforinfotech.com/p/mcqs.html a) Insertion b) Deletion c) Retrieval d) Traversal A) only a,b and c B) only a and b C) All of the above D) None of the above

Description : ………………. is not an operation performed on linear list Get More Mcqs from http://www.siteforinfotech.com/p/mcqs.html a) Insertion b) Deletion c) Retrieval d) Traversal A) only a,b and c B) only a and b C) All of the above D) None of the above

Last Answer : D) None of the above

The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is ............ (A) dbefacg (B) debfagc (C) dbefcga (D) debfgca

Description : The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is ............ (A) dbefacg (B) debfagc (C) dbefcga (D) debfgca

Last Answer : (D) debfgca

The inorder traversal of the following tree is: Image (A) 2 3 4 6 7 13 15 17 18 18 20 (B) 20 18 18 17 15 13 7 6 4 3 2 (C) 15 13 20 4 7 17 18 2 3 6 18 (D) 2 4 3 13 7 6 15 17 20 18 18

Description : The inorder traversal of the following tree is: (A) 2 3 4 6 7 13 15 17 18 18 20 (B) 20 18 18 17 15 13 7 6 4 3 2 (C) 15 13 20 4 7 17 18 2 3 6 18 (D) 2 4 3 13 7 6 15 17 20 18 18

Last Answer : Answer: D 

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

The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling Salesman problem c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Last Answer : b) Travelling Salesman problem

Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state which of the following state cannot be reached?

Description : Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state  which of the following state cannot be reached? 

Last Answer : Answer: C

Write the coordinates of the vertices of a rectangle whose lenght and breadth are 7 and 4 units respectively,one vertex atthe the origin,the longer side lies on the x-axis and one of the vertices lies in the third quadrant. -Maths 9th

Description : Write the coordinates of the vertices of a rectangle whose lenght and breadth are 7 and 4 units respectively,one vertex atthe the origin,the longer side lies on the x-axis and one of the vertices lies in the third quadrant. -Maths 9th

Last Answer : Solution :-

Write the coordinates of the vertices of a rectangle whose length and breadth are 6 and 3 units respectively, one vertex at the origin, the longer side lies on the y-axis and one of the vertices lies in the second quadrant. -Maths 9th

Description : Write the coordinates of the vertices of a rectangle whose length and breadth are 6 and 3 units respectively, one vertex at the origin, the longer side lies on the y-axis and one of the vertices lies in the second quadrant. -Maths 9th

Last Answer : Solution :-

What is when Two angles that have a common vertex and one common side are called Question 6 options Straight Angles Complementary Angles Adjacent Angles Opposite Angles?

Description : What is when Two angles that have a common vertex and one common side are called Question 6 options Straight Angles Complementary Angles Adjacent Angles Opposite Angles?

Last Answer : They are adjacent angles.

What is when Two angles that have a common vertex and one common side are called Question 6 options Straight Angles Complementary Angles Adjacent Angles Opposite Angles?

Description : What is when Two angles that have a common vertex and one common side are called Question 6 options Straight Angles Complementary Angles Adjacent Angles Opposite Angles?

Last Answer : They are adjacent angles.

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. A) Weakly connected B) Strongly Connected C) Tightly Connected D) Linearly Connected

Description : A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. A) Weakly connected B) Strongly Connected C) Tightly Connected D) Linearly Connected

Last Answer : B) Strongly Connected

A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Description : A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Last Answer : (D) maximal, minimal 

A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph? (A) 5 (B) n – 3 (C) 20 (D) 11

Description : A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph? (A) 5 (B) n – 3 (C) 20 (D) 11

Last Answer : (D) 11

Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg(w) ≥ n for every v and w not connected by an edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Description : Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg( ... edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

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

A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles. (A) n-2, n-1 (B) n-3, n-2 (C) n-1, n (D) n-2, n-2

Description : A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles. (A) n-2, n-1 (B) n-3, n-2 (C) n-1, n (D) n-2, n-2

Last Answer : (B) n-3, n-2

Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is (A) 726 (B) 796 (C) 506 (D) 616

Description : Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is (A) 726 (B) 796 (C) 506 (D) 616

Last Answer : (D) 616

What happens when there are no descendents left to pay for cemetery plot maintenance?

Description : What happens when there are no descendents left to pay for cemetery plot maintenance?

Last Answer : I thought all graves came with perpetual care. I know that mine did.

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

In a typical mobile phone system with hexagonal cells, it is forbidden to reuse a frequency band in adjacent cells. If 840 frequencies are available, how many can be used in a given cell? (A) 280 (B) 210 (C) 140 (D) 120

Description : In a typical mobile phone system with hexagonal cells, it is forbidden to reuse a frequency band in adjacent cells. If 840 frequencies are available, how many can be used in a given cell? (A) 280 (B) 210 (C) 140 (D) 120

Last Answer : Answer: A Explanation: Each cell has six other adjacent cells, in a hexagonal grid. If the central cell uses frequency group A, its six adjacent cells can use B, C, B, C, B, and C respectively. In other words, only 3 unique cells are needed. So the answer is 840/3 = 280 frequencies.

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?

Description : A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are ... (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : Answer: D

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

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 search method takes less memory? (A) Depth-First Search (B) Breadth-First search (C) Both (A) and (B) (D) Linear Search

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

Last Answer : (A) Depth-First Search

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

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