Which of the following connected simple graph has exactly one spanning tree? (A) Complete graph (B) Hamiltonian graph (C) Euler graph (D) None of the above

Which of the following connected simple graph has exactly one spanning tree? (A) Complete graph (B) Hamiltonian graph (C) Euler graph (D) None of the above
by

1 Answer

Answer :

(D) None of the above
by

Related questions

Consider the Graph shown below : Image This graph is a ............... (A) Complete Graph (B) Bipartite Graph (C) Hamiltonian Graph (D) All of the above

Description : Consider the Graph shown below : This graph is a ............... (A) Complete Graph (B) Bipartite Graph (C) Hamiltonian Graph (D) All of the above

Last Answer : (C) Hamiltonian Graph

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)

The number of different spanning trees in complete graph, K4 and bipartite graph K2,2 have .......... and .....…. respectively. (A) 14, 14 (B) 16, 14 (C) 16, 4 (D) 14, 4

Description : The number of different spanning trees in complete graph, K4 and bipartite graph K2,2 have .......... and .....…. respectively. (A) 14, 14 (B) 16, 14 (C) 16, 4 (D) 14, 4

Last Answer : (C) 16, 4 

How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? (A) M+N-C (B) M-N-C (C) M-N+C (D) M+N+C

Description : How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? (A) M+N-C (B) M-N-C (C) M-N+C (D) M+N+C

Last Answer : (C) M-N+C

A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below? Image (A) 2 (B) 4 (C) 5 (D) 6

Description : A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below?  (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (C) 5

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

State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False

Description : State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False

Last Answer : A) True, True

State True of False. i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no edge between every pair of vertices. A) True, False, True B) True, True, False C) True, True, True D) False, True, True

Description : State True of False. i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no ... ) True, False, True B) True, True, False C) True, True, True D) False, True, True

Last Answer : B) True, True, False

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

Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be (A) 4, 5 (B) 5, 4 (C) 3, 1 (D) 13, 8

Description : Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be (A) 4, 5 (B) 5, 4 (C) 3, 1 (D) 13, 8

Last Answer : (B) 5, 4

The directory structure used in Unix file system is called (A) Hierarchical directory (B) Tree structured directory (C) Directed acyclic graph (D) Graph structured directory

Description : The directory structure used in Unix file system is called (A) Hierarchical directory (B) Tree structured directory (C) Directed acyclic graph (D) Graph structured directory

Last Answer : (C) Directed acyclic graph

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

The maximum ratio of span to depth of a slab simple supported and spanning in two directions, is (a) 25 (b) 30 (c) 35 (d) 40

Description : The maximum ratio of span to depth of a slab simple supported and spanning in two directions, is (a) 25 (b) 30 (c) 35 (d) 40

Last Answer : (c) 35

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

If all devices are connected to a central hub, then topology is called A) Bus Topology B) Ring Topology C) Star Topology D) Tree Topology

Description : If all devices are connected to a central hub, then topology is called A) Bus Topology B) Ring Topology C) Star Topology D) Tree Topology

Last Answer : C) Star Topology

A bridge can use the _________algorithm tocreate aloopless topology. A) binary tree B) spanning tree C) multiway tree D) none of the abov

Description : A bridge can use the _________algorithm tocreate aloopless topology. A) binary tree B) spanning tree C) multiway tree D) none of the abov

Last Answer : spanning tree

Which algorithm is used to shape the bursty traffic into a fixed rate traffic by averaging the data rate? a. solid bucket algorithm b. spanning tree algorithm c. hocken helm algorithm d. leaky bucket algorithm

Description : Which algorithm is used to shape the bursty traffic into a fixed rate traffic by averaging the data rate? a. solid bucket algorithm b. spanning tree algorithm c. hocken helm algorithm d. leaky bucket algorithm

Last Answer : d. leaky bucket algorithm

A subset of a network that includes all the routers but contains no loops is called ________ a. spanning tree b. spider structure c. spider tree d. special tree

Description : A subset of a network that includes all the routers but contains no loops is called ________ a. spanning tree b. spider structure c. spider tree d. special tree

Last Answer : a. spanning tree

The subset of a network that includes all the routers but contains no loops is called ________A. spanning tree B. spider structure C. spider tree D. special tree

Description : The subset of a network that includes all the routers but contains no loops is called ________ A. spanning tree B. spider structure C. spider tree D. special tree

Last Answer : A. spanning tree

One subset of a network that includes all the routers but contains no loops is called ________ A. spanning tree B. spider structure C. spider tree D. special tree

Description : One subset of a network that includes all the routers but contains no loops is called ________ A. spanning tree B. spider structure C. spider tree D. special tree

Last Answer : A. spanning tree

What is Spanning tree?

Description : What is Spanning tree?

Last Answer : It is for the bridges to select ports over which they will forward frames. A spanning tree is a subgraph of this graph that covers (spans) all the vertices, but contains no cycles. It keeps all of the vertices of the original graph, but throws out some of the edges.

A ……….. is a graph that has weights of costs associated with its edges. A) Network B) Weighted graph C) Both A and B D) None A and B

Description : A ……….. is a graph that has weights of costs associated with its edges. A) Network B) Weighted graph C) Both A and B D) None A and B

Last Answer : C) Both A and B

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

A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. A) Partite B) Bipartite C) Rooted D) Bisects

Description : A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. A) Partite B) Bipartite C) Rooted D) Bisects

Last Answer : B) Bipartite

Cyclometric complexity of a flow graph G with n vertices and e edges is (A) V(G) = e+n-2 (B) V(G) = e-n+2 (C) V(G) = e+n+2 (D) V(G) = e-n-2

Description : Cyclometric complexity of a flow graph G with n vertices and e edges is (A) V(G) = e+n-2 (B) V(G) = e-n+2 (C) V(G) = e+n+2 (D) V(G) = e-n-2

Last Answer : (B) V(G) = e-n+2

A graph is non-planar if and only if it contains a subgraph homeomorphic to (A) K3,2 or K5 (B) K3,3 and K6 (C) K3,3 or K5 (D) K2,3 and K5

Description : A graph is non-planar if and only if it contains a subgraph homeomorphic to (A) K3,2 or K5 (B) K3,3 and K6 (C) K3,3 or K5 (D) K2,3 and K5

Last Answer : (C) K3,3 or K5 Explanation: Kuratowski’s Theorem: A graph is non-planar if and only if it contains a subgraph that is homeomorphic to either K5 or K3,3.

Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions – 1 (B) E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) P – 1, where P is the number of predicate nodes in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Description : Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions - 1 (B) E - N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) ... in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Last Answer : (D) P + 1, where P is the number of predicate nodes in the flow graph G.

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. Image It shows which of the following depth first forest? (A) {a,b,e} {c,d,f,g,h} (B) {a,b,e} {c,d,h} {f,g} (C) {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.  It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Last Answer : Answer: A

The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (A) P + 1 (B) P - 1 (C) P - 2 (D) P + 2 Where P is number of predicate nodes in flow graph V(G).

Description : The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (A) P + 1 (B) P - 1 (C) P - 2 (D) P + 2 Where P is number of predicate nodes in flow graph V(G).

Last Answer : (A) P + 1 

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

In Artificial Intelligence (AI), what is present in the planning graph? (1) Sequence of levels (2) Literals (3) Variables (4) Heuristic estimates

Description : In Artificial Intelligence (AI), what is present in the planning graph? (1) Sequence of levels (2) Literals (3) Variables (4) Heuristic estimates

Last Answer : Sequence of levels

Which statement represents the following Euler diagram?

Description : Which statement represents the following Euler diagram?

Last Answer : If someone lives in Austin, then that person lives in Texas.

Which of the following is directly concerned with the heat transfer? (A) Strouhal number (B) Sherwood number (C) Euler number (D) Grashoff number

Description : Which of the following is directly concerned with the heat transfer? (A) Strouhal number (B) Sherwood number (C) Euler number (D) Grashoff number

Last Answer : (D) Grashoff number

The ratio of inertial forces to gravity forces is called the __________ number. (A) Mach (B) Froude (C) Euler (D) Weber

Description : The ratio of inertial forces to gravity forces is called the __________ number. (A) Mach (B) Froude (C) Euler (D) Weber

Last Answer : (B) Froude

N2 Re /NFr is called the __________ number. (A) Brinkman (B) Galileo (C) Archimedes (D) Euler

Description : N2 Re /NFr is called the __________ number. (A) Brinkman (B) Galileo (C) Archimedes (D) Euler

Last Answer : (B) Galileo

Which of the following is not a dimension-less parameter? (A) Euler number (B) Specific gravity (C) Fanning friction factor (D) None of these

Description : Which of the following is not a dimension-less parameter? (A) Euler number (B) Specific gravity (C) Fanning friction factor (D) None of these

Last Answer : (D) None of these

Ratio of pressure and inertia force gives __________ number. (A) Weber (B) Mach (C) Euler (D) Froude

Description : Ratio of pressure and inertia force gives __________ number. (A) Weber (B) Mach (C) Euler (D) Froude

Last Answer : (C) Euler

Which of the following denotes the effect of compressibility in fluid flow? (A) Weber number (B) Mach number (C) Euler number (D) Reynolds number

Description : Which of the following denotes the effect of compressibility in fluid flow? (A) Weber number (B) Mach number (C) Euler number (D) Reynolds number

Last Answer : (B) Mach numbe

The ratio of inertial forces to elastic forces is called the __________ number. (A) Reynolds (B) Mach (C) Euler (D) Weber

Description : The ratio of inertial forces to elastic forces is called the __________ number. (A) Reynolds (B) Mach (C) Euler (D) Weber

Last Answer : (B) Mach

The ratio of inertial forces to elastic forces is called the __________ number. (A) Reynolds (B) Mach (C) Euler (D) Weber

Description : The ratio of inertial forces to elastic forces is called the __________ number. (A) Reynolds (B) Mach (C) Euler (D) Weber

Last Answer : (B) Mach

Ratio of inertial forces to surface tension forces is called the __________ number. (A) Euler (B) Froude (C) Mach (D) Weber

Description : Ratio of inertial forces to surface tension forces is called the __________ number. (A) Euler (B) Froude (C) Mach (D) Weber

Last Answer : (D) Weber

The ratio of pressure forces to inertial forces is called the __________ number. (A) Froude (B) Euler (C) Reynold (D) Mach

Description : The ratio of pressure forces to inertial forces is called the __________ number. (A) Froude (B) Euler (C) Reynold (D) Mach

Last Answer : (B) Euler

Euler number is defined as the ratio of inertia force to __________ force. (A) Pressure (B) Elastic (C) Gravity (D) Viscous

Description : Euler number is defined as the ratio of inertia force to __________ force. (A) Pressure (B) Elastic (C) Gravity (D) Viscous

Last Answer : (A) Pressure

Pure Buckling uses the equation of (a) Rankin-Gordon (b) Euler (c) Stiffness (d) None

Description : Pure Buckling uses the equation of (a) Rankin-Gordon (b) Euler (c) Stiffness (d) None

Last Answer : (b) Euler

For like predicate which of the following is true. i) % matches zero of more characters. ii) _ matches exactly one character. A) i-only B) ii-only C) Both of them D) None of them

Description : For like predicate which of the following is true. i) % matches zero of more characters. ii) _ matches exactly one character. A) i-only B) ii-only C) Both of them D) None of them

Last Answer : C) Both of them

Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? (A) (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r) (B) (p∧q∨r) ∧ (p∧q∧r) ∨ (˥q∨˥p∧˥r) (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r) (D) (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r)

Description : Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? (A) (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r) (B) ... ) ∨ (˥q∨˥p∧˥r) (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r) (D) (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r) 

Last Answer : (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r)