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

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
by

1 Answer

Answer :

B) Bipartite
by

Related questions

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

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

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

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)

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

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 

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

For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges

Description : For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges

Last Answer : a) By maintaining a list of visited vertices

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)

Q No: 251 In a sludge digestion tank if the moisture content of sludge V1 litres is reduced from p1 % to p2 % the volume V2 is A. [(100 + P1)/(100 – P2)] V1 B. [(100 – P1)/(100 + P2)] V1 C. [(100 – P1)/(100 – P2)] V1 D. [(100 + P2)/(100 – P1)] V1

Description : Q No: 251 In a sludge digestion tank if the moisture content of sludge V1 litres is reduced from p1 % to p2 % the volume V2 is A. [(100 + P1)/(100 – P2)] V1 B. [(100 – P1)/(100 + P2)] V1 C. [(100 – P1)/(100 – P2)] V1 D. [(100 + P2)/(100 – P1)] V1

Last Answer : ANS: C

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

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

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

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.

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 are V1 and V2? How they are connected? What is the harm in opening F/M vault door during reactor operation?

Description : What are V1 and V2? How they are connected? What is the harm in opening F/M vault door during reactor operation? 

Last Answer : The reactor building is divided into two areas. They are V1 and V2. V1 - Dry volume area. V2 - Wet volume area. V1 area includes F/M vault, boiler room, and entire dome area. ... directly goes to F/M maintenance area, which is a V2 area. Thus pressurizing the entire building. 

Area(s) in the visual cortex involved in colour vision include: a. V1 b. V2 c. V3 d. V8

Description : Area(s) in the visual cortex involved in colour vision include: a. V1 b. V2 c. V3 d. V8

Last Answer : V8

essure drop (Δp) for a fluid flowing in turbulent flow through a pipe is a function of velocity (V) as (A) V1.8 (B) V-0.2 (C) V2.7 (D) V

Description : essure drop (Δp) for a fluid flowing in turbulent flow through a pipe is a function of velocity (V) as (A) V1.8 (B) V-0.2 (C) V2.7 (D) V

Last Answer : (D) V

The compressibility factor of a gas is given by (where, V1 = actual volume of the gas V2 = gas volume predicted by ideal gas law) (A) V1/V2 (B) V2/V1 (C) V1- V2 (D) V1.V2

Description : The compressibility factor of a gas is given by (where, V1 = actual volume of the gas V2 = gas volume predicted by ideal gas law) (A) V1/V2 (B) V2/V1 (C) V1- V2 (D) V1.V2

Last Answer : (A) V1/V2

The expression for entropy change given by, ΔS = nR ln (V2/V1) + nCvln (T2/T1) is valid for (A) Reversible isothermal volume change (B) Heating of a substance (C) Cooling of a substance (D) Simultaneous heating and expansion of an ideal gas

Description : The expression for entropy change given by, ΔS = nR ln (V2/V1) + nCvln (T2/T1) is valid for (A) Reversible isothermal volume change (B) Heating of a substance (C) Cooling of a substance (D) Simultaneous heating and expansion of an ideal gas

Last Answer : (D) Simultaneous heating and expansion of an ideal gas

According to equation of continuity, (A) w1a1 = w2a2 (B) w1v1 = w2v2 (C) a1v1 = a2v2 (D) a1/v1 = a2/v2

Description : According to equation of continuity, (A) w1a1 = w2a2 (B) w1v1 = w2v2 (C) a1v1 = a2v2 (D) a1/v1 = a2/v2

Last Answer : Answer: Option C

A certain gas with cp = 0.529Btu/lb°R and R = 96.2ft/lbºR expands from 5 ft and 80ºF to 15 ft while the pressure remains constant at 15.5 psia.  a. T2=1.620ºR, ∫H = 122.83 Btu  b. T2 = 2°R, ∫H = 122.83 Btu  c. T2 = 2.620ºR, ∫H = 122.83 Btu  d. T2 = 1°R, ∫H = 122.83 Btu T2= V2(t2)/V1 and ∫H = mcp (T2-T1)

Description : A certain gas with cp = 0.529Btu/lb°R and R = 96.2ft/lbºR expands from 5 ft and 80ºF to 15 ft while the pressure remains constant at 15.5 psia.  a. T2=1.620ºR, ∫H = 122.83 Btu  b. T2 = 2°R, ∫H = 122.83 Btu  c. ... , ∫H = 122.83 Btu  d. T2 = 1°R, ∫H = 122.83 Btu T2= V2(t2)/V1 and ∫H = mcp (T2-T1)

Last Answer : T2=1.620ºR, ∫H = 122.83 Btu

Gas is enclosed in a cylinder with a weighted piston as the stop boundary. The gas is heated and expands from a volume of 0.04 m^3 to 0.10 m^3 at a constant pressure of 200kPa.Calculate the work done by the system.  A. 8 kJ  B. 10 kJ  C.12 kJ  D.14 kJ Formula: W = p(V2-V1)

Description : Gas is enclosed in a cylinder with a weighted piston as the stop boundary. The gas is heated and expands from a volume of 0.04 m^3 to 0.10 m^3 at a constant pressure of 200kPa.Calculate the work done by the system.  A. 8 kJ  B. 10 kJ  C.12 kJ  D.14 kJ Formula: W = p(V2-V1)

Last Answer : 12 kJ

Helium ( R= 0.4698 BTU/lbm-˚R ) is compressed isothermally from 14.7 psia and 68 ˚F. The compression ratio is 1:4. Calculate the work done by the gas.  A. –1454 BTU/lbm  B. -364 BTU/lbm  C.-187BTU/lbm  D.46.7 BTU/lbm Formula: W = RT ln (V2/V1)

Description : Helium ( R= 0.4698 BTU/lbm-˚R ) is compressed isothermally from 14.7 psia and 68 ˚F. The compression ratio is 1:4. Calculate the work done by the gas.  A. –1454 BTU/lbm  B. -364 BTU/lbm  C.-187BTU/lbm  D.46.7 BTU/lbm Formula: W = RT ln (V2/V1)

Last Answer : -364 BTU/lbm

Twenty grams of oxygen gas are compressed at a constant temperature of 30 ˚C to 5%of their original volume. What work is done on the system.  A.824 cal  B.924 cal  C.944 cal  D.1124 cal Formula: W = -mRTln (V2/V1) Where R = (1.98 cal/gmole·K) (32 g/gmole)

Description : Twenty grams of oxygen gas are compressed at a constant temperature of 30 ˚C to 5%of their original volume. What work is done on the system.  A.824 cal  B.924 cal  C.944 cal  D.1124 cal Formula: W = -mRTln (V2/V1) Where R = (1.98 cal/gmole·K) (32 g/gmole)

Last Answer : 1124 cal

What is the equation for the work done by a constant temperature system?  A. W = mRTln(V2-V1)  B. W = mR( T2-T1 ) ln( V2/V1)  C. W = mRTln (V2/V1)  D. W = RT ln (V2/V1) Formula : W=∫ pdV lim1,2 ∫ = mRT / V

Description : What is the equation for the work done by a constant temperature system?  A. W = mRTln(V2-V1)  B. W = mR( T2-T1 ) ln( V2/V1)  C. W = mRTln (V2/V1)  D. W = RT ln (V2/V1) Formula : W=∫ pdV lim1,2 ∫ = mRT / V

Last Answer : W = mRTln (V2/V1)

Which of the following is the mathematical representation of the Charles’s law?  A. V1/V2= P2/P1  B. V1/T1=V2/T2  C. V1/T2=V2/T1  D. V1/V2=√P2/√P1

Description : Which of the following is the mathematical representation of the Charles’s law?  A. V1/V2= P2/P1  B. V1/T1=V2/T2  C. V1/T2=V2/T1  D. V1/V2=√P2/√P1

Last Answer : V1/T1=V2/T2

he following is true of desmopressin except: A. It is nonselective V1 and V2 receptor agonist B. It is more potent and longer acting than arginine vasopressin (AVP) C. It is preferred over AVP for treatment of diabetes insipidus D. It can be administered orally

Description : Che following is true of desmopressin except: A. It is nonselective V1 and V2 receptor agonist B. It is more potent and longer acting than arginine vasopressin (AVP) C. It is preferred over AVP for treatment of diabetes insipidus D. It can be administered orally

Last Answer : A. It is nonselective V1 and V2 receptor agonist

KVA of an Auto-transformer of V1/V2 = 220/150 for a load of 100KVA is:

Description : KVA of an Auto-transformer of V1/V2 = 220/150 for a load of 100KVA is: a. 100KVA b. 50KVA c. 33.3KVA d. 20KVA 

Last Answer : KVA of an Auto-transformer of V1/V2 = 220/150 for a load of 100KVA is: a. 100KVA b. 50KVA c. 33.3KVA d. 20KVA 

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

In STL files Euler’s rule for solids can be written as a.No. of faces – No. of edges + No. of vertices = 3 x No. of bodies b.No. of faces – No. of edges + No. of vertices = No. of bodies c.No. of faces – No. of edges + No. of vertices = 2 x No. of bodies d.No. of faces – No. of edges + No. of vertices = 4 x No. of bodies

Description : In STL files Euler’s rule for solids can be written as a.No. of faces †No. of edges + No. of vertices = 3 x No. of bodies b.No. of faces †No. of edges + No. of vertices = No. of bodies c.No. of ... = 2 x No. of bodies d.No. of faces †No. of edges + No. of vertices = 4 x No. of bodies

Last Answer : c.No. of faces – No. of edges + No. of vertices = 2 x No. of bodies

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

How many edges and vertices are there for an octahedron which is a polyhedron with eight congruent triangular faces?

Description : How many edges and vertices are there for an octahedron which is a polyhedron with eight congruent triangular faces?

Last Answer : Need answer

How many face edges and vertices does a rectangular prism have?

Description : How many face edges and vertices does a rectangular prism have?

Last Answer : A rectangular prism has 6 faces, 12 edges and 8 vertices

What shape has 0 vertices 2 edges 2 faces and 1 curved surface?

Description : What shape has 0 vertices 2 edges 2 faces and 1 curved surface?

Last Answer : Feel Free to Answer

What shape has 2 flat faces 1 curved face 2 edges 0 vertices?

Description : What shape has 2 flat faces 1 curved face 2 edges 0 vertices?

Last Answer : A cylinder would fit the given description

What has 5 faces, 8 edges,5 vertices?

Description : What has 5 faces, 8 edges,5 vertices?

Last Answer : triangular prism

If l1 and l2 are the lengths of long and short spans of a two way slab simply supported on four edges and carrying a load w per unit area, the ratio of the loads split into w1 and w2acting on strips parallel to l2 and l1 is (A) w1/w2 = l2/l1 (B) w1/w2 = (l2/l1)² (C) w1/w2 = (l2/l1)3 (D) w1/w2 = (l2/l1)

Description : If l1 and l2 are the lengths of long and short spans of a two way slab simply supported on four edges and carrying a load w per unit area, the ratio of the loads split into w1 and w2acting on strips parallel to l2 and l1 is (A) ... l1 (B) w1/w2 = (l2/l1)² (C) w1/w2 = (l2/l1)3 (D) w1/w2 = (l2/l1)

Last Answer : Answer: Option D

_____ infections have cost more money and taken more time to repair than any other virus type: a) File Infector Viruses b) Multi Partite Viruses c) Macro Viruses d) None of These

Description : _____ infections have cost more money and taken more time to repair than any other virus type: a) File Infector Viruses b) Multi Partite Viruses c) Macro Viruses d) None of These

Last Answer : c) Macro Viruses

_______viruses infect executable program files: a) File Infector Viruses b) Macro Viruses c) Multi Partite Viruses d) None of These

Description : _______viruses infect executable program files: a) File Infector Viruses b) Macro Viruses c) Multi Partite Viruses d) None of These

Last Answer : a) File Infector Viruses

How do I show that a simple graph of size n >= 2 always has at least two vertices of the same degree?

Description : How do I show that a simple graph of size n >= 2 always has at least two vertices of the same degree?

Last Answer : Here's one idea... just use counting:

what- A triangle is formed by the intersection of the lines y = 0, y = -3x + 3, and y = 3x + 3.Is the triangle equilateral, isosceles, or scalene Graph the lines on grid paper to find the vertices of the triangle?

Description : what- A triangle is formed by the intersection of the lines y = 0, y = -3x + 3, and y = 3x + 3.Is the triangle equilateral, isosceles, or scalene Graph the lines on grid paper to find the vertices of the triangle?

Last Answer : isosceles

what- A triangle is formed by the intersection of the lines y = 2x + 4, y = -x – 2, and x = 1.Is the triangle equilateral, isosceles, or scalene Graph the lines on grid paper to find the vertices of the triangle?

Description : what- A triangle is formed by the intersection of the lines y = 2x + 4, y = -x – 2, and x = 1.Is the triangle equilateral, isosceles, or scalene Graph the lines on grid paper to find the vertices of the triangle?

Last Answer : scalene

How can i use a graph to find the number of vertices in a octagonal pyramid?

Description : How can i use a graph to find the number of vertices in a octagonal pyramid?

Last Answer : The number of vertices in an octagonal pyramid is 9,irrespective of any graph.