Consider the graph given below: The two distinct sets of vertices, which make the graph bipartite are: (A) (v1, v4, v6); (v2, v3, v5, v7, v8) (B) (v1, v7, v8); (v2, v3, v5, v6) (C) (v1, v4, v6, v7); (v2, v3, v5, v8) (D) (v1, v4, v6, v7, v8); (v2, v3, v5)

Consider the graph given below:

image

by

1 Answer

Answer :

(C) (v1, v4, v6, v7); (v2, v3, v5, v8) 
by

Related questions

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

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

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

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

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 

The following are involved in colour vision: a. P pathway b. M pathway c. area V8 of visual cortex d. area V3 of visual cortex

Description : The following are involved in colour vision: a. P pathway b. M pathway c. area V8 of visual cortex d. area V3 of visual cortex

Last Answer : area V8 of visual cortex

Which of the following is Virial equation of state? (A) (p + a/V2)(V - b) = nRT (B) PV = nRT (C) PV = A + B/V + C/V2 + D/V3 + ... (D) None of these

Description : Which of the following is Virial equation of state? (A) (p + a/V2)(V - b) = nRT (B) PV = nRT (C) PV = A + B/V + C/V2 + D/V3 + ... (D) None of these

Last Answer : (C) PV = A + B/V + C/V2 + D/V3 + ...

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

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

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

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

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 

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)

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

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. 

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

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 

Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student e where e course='5' and e marks ≥ s marks) Q.2. Select S.stuid From student S Where s.marks > any (select distinct marks from student S where s.couse = 5) (A) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Description : Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student ... ) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Last Answer : (B) Q.2 Explanation: First query gives stuid of students whose marks are greater than all students taking course 5. Second query gives stuid of students whose marks are greater than any student taking ... comparison is between maximum of marks by any student in course 5. So the answer is option D.

38. Consider three sets \( X, Y \) and \( Z \) having 6,5 and 4 elements respectively. A.11 these 15 elements are distinct. Let \( S=(X-Y) \cup Z \). How many proper subsets does \( S \) have?(a) 255(b) 256(c) 1023(d) 1024

Description : 38. Consider three sets \( X, Y \) and \( Z \) having 6,5 and 4 elements respectively. A.11 these 15 elements are distinct. Let \( S=(X-Y) \cup Z \). How many proper subsets does \( S \) have?(a) 255(b) 256(c) 1023(d) 1024

Last Answer : 38. Consider three sets \( X, Y \) and \( Z \) having 6,5 and 4 elements respectively. A.11 these 15 ... have? (a) 255 (b) 256 (c) 1023 (d) 1024

Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: Image If different symbols stand for different values (e.g., t1 is definitely not equal to t2), then which of the above could not be the relationship set for the E-R diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Description : Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ... diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Last Answer : (A) I only

The number of distinct binary images which can be generated from a given binary image of right M × N are (A) M + N (B) M × N (C) 2M + N (D) 2MN

Description : The number of distinct binary images which can be generated from a given binary image of right M × N are (A) M + N (B) M × N (C) 2M + N (D) 2MN

Last Answer : (D) 2MN

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)

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

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

Consider the following transportation problem: Image The initial basic feasible solution of the above transportation problem using Vogel’s Approximation Method(VAM) is given below: The solution of the above problem: (A) is degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution

Description : Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation Method(VAM) is given below: The solution of the ... degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution

Last Answer : (B) is optimum solution

Consider the compound propositions given below as: (a) p˅~(p˄q) (b) (p˄~q)˅~(p˄q) (c) p˄(q˅r) Which of the above propositions are tautologies? (A) (a) and (c) (B) (b) and (c) (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the compound propositions given below as: (a) p˅~(p˄q) (b) (p˄~q)˅~(p˄q) (c) p˄(q˅r) Which of the above propositions are tautologies? (A) (a) and (c) (B) (b) and (c) (C) (a) and (b) (D) (a), (b) and (c)

Last Answer : Answer: Marks to all

hello, I have a board ASUS EX-B250-V7 advise me what to choose for the best processor thanks

Description : motherboard asus ex-b250-v7.what I should choose a processor for it

Last Answer : Need Answer

How do you Reset ASPIRE V5-122P-0408?

Description : How do you Reset ASPIRE V5-122P-0408?

Last Answer : What is the answer ?

A bed of spherical particles (specific gravity 2.5) of uniform size 1500 μm is 0.5 m in diameter and 0.5 m high. In packed bed state, the porosity may be taken as 0.4. Ergun's equation for the above fluid-particle system (in SI units) is given below : Δ P/L = 375 × 10 3 VOM + 10.94 × 10 6 V2 OM (SI units) If water is to be used as the fluidising medium, the minimum fluidisation velocity, VOM is (A) 12 mm/s (B) 16 mm/s (C) 24 mm/s (D) 28 mm/s

Description : A bed of spherical particles (specific gravity 2.5) of uniform size 1500 μm is 0.5 m in diameter and 0.5 m high. In packed bed state, the porosity may be taken as 0.4. Ergun's equation for the above fluid-particle ... fluidisation velocity, VOM is (A) 12 mm/s (B) 16 mm/s (C) 24 mm/s (D) 28 mm/s

Last Answer : (B) 16 mm/s

A bed of spherical particles (specific gravity 2.5) of uniform size 1500 μm is 0.5 m in diameter and 0.5 m high. In packed bed state, the porosity may be taken as 0.4. Ergun's equation for the above fluid-particle system (in SI units) is given below: Δ P/L = 375 × 10 3 VOM + 10.94 × 10 6 V2 OM (SI units) If water is to be used as the fluidising medium, in actual operation, the above bed has a height = 1 m. What is the porosity of the fluidised bed? (A) 0.2 (B) 0.5 (C) 0.7 (D) 0.8

Description : A bed of spherical particles (specific gravity 2.5) of uniform size 1500 μm is 0.5 m in diameter and 0.5 m high. In packed bed state, the porosity may be taken as 0.4. Ergun's equation for the above fluid-particle system ... What is the porosity of the fluidised bed? (A) 0.2 (B) 0.5 (C) 0.7 (D) 0.8

Last Answer : (C) 0.7

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

How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ? (A) 16 (B) 17 (C) 18 (D) 19

Description : How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ? (A) 16 (B) 17 (C) 18 (D) 19

Last Answer : (D) 19

Given the following statements : S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2. S2 : The set-partition problem takes as input a set S of numbers and asks whether the numbers can be partitioned into two sets A Image Which of the following is true ? (A) S1 is NP problem and S2 is P problem. (B) S1 is NP problem and S2 is NP problem. (C) S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Description : Given the following statements :  S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2.  S2 : The set-partition problem takes as input a set S of numbers and ... S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Last Answer : (B) S1 is NP problem and S2 is NP problem.

Let A and B be sets in a finite universal set U. Given the following: |A – B|, |AÅB|, |A|+|B| and |AÈB| Which of the following is in order of increasing size ? (A) |A – B| ≤ |AÅB| ≤ |A| + |B| ≤ |AÈB| (B) |AÅB| ≤ |A – B| ≤ |AÈB| ≤ |A| + |B| (C) |AÅB| ≤ |A| + |B| ≤ |A – B| ≤ |AÈB| (D) |A – B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|

Description : Let A and B be sets in a finite universal set U. Given the following: |A - B|, |AÅB|, |A|+|B| and |AÈB| Which of the following is in order of increasing size ? (A) |A - B| ≤ |AÅB| ≤ |A| + |B| ≤ |AÈB| (B) |AÅB| ≤ |A ... |AÅB| ≤ |A| + |B| ≤ |A - B| ≤ |AÈB| (D) |A - B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|

Last Answer : (D) |A – B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|

Which among the following is a non-durable good ? 1. soap 2. maturity 3. color T.V4. clothes 5. none of these

Description : Which among the following is a non-durable good ? 1. soap 2. maturity 3. color T.V 4. clothes 5. none of these

Last Answer : soap