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

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
by

1 Answer

Answer :

B) Strongly Connected
by

Related questions

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 …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1. A) Directed tree B) Undirected tree C) Dis-joint tree D) Direction oriented tree

Description : A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1. A) Directed tree B) Undirected tree C) Dis-joint tree D) Direction oriented tree

Last Answer : A) Directed tree

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

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

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

[Fe(H2O)6]3+ is strongly paramagnetic whereas [Fe(CN)6]3- is weakly paramagnetic. Explain. (At. no. Fe = 26) -Chemistry

Description : [Fe(H2O)6]3+ is strongly paramagnetic whereas [Fe(CN)6]3- is weakly paramagnetic. Explain. (At. no. Fe = 26) -Chemistry

Last Answer : In both the cases, Fe is in oxidation state +3. Outer electronic configuration of Fe+3 is : In the presence of CN-, the 3d electrons pair up leaving only one unpaired electron. The ... sp3d2 forming an outer orbital complex. As it contains five unpaired electrons so it is strongly paramagnetic. .

Cobalt is a material which is ? A. Strongly attracted by a magnet (Answer) B. Not attracted by a magnet C. not a magnet D. Weakly attracted by a magnet E. None of these

Description : Cobalt is a material which is ? A. Strongly attracted by a magnet (Answer) B. Not attracted by a magnet C. not a magnet D. Weakly attracted by a magnet E. None of these

Last Answer : A. Strongly attracted by a magnet (Answer)

Pick out the wrong statement. (A) Cokes of high reactivity are obtained from weakly coking coals (B) Cokes of high reactivity are obtained from strongly coking coals (C) Reactivity of coke is inversely proportional to its absolute density (D) Abrasion index of the coke is a measure of its hardness

Description : Pick out the wrong statement. (A) Cokes of high reactivity are obtained from weakly coking coals (B) Cokes of high reactivity are obtained from strongly coking coals (C) Reactivity of coke is inversely proportional to its absolute density (D) Abrasion index of the coke is a measure of its hardness

Last Answer : (B) Cokes of high reactivity are obtained from strongly coking coals

A solution with a pH of 12 is: w) weakly acidic x) strongly acidic y) weakly basic z) strongly basic

Description : A solution with a pH of 12 is: w) weakly acidic x) strongly acidic y) weakly basic z) strongly basic

Last Answer : ANSWER: Z -- STRONGLY BASIC

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

Free electrons are: (a) Fixed (b) Loosely bounded (c) Strongly fixed (d) Tightly bound

Description : Free electrons are: (a) Fixed (b) Loosely bounded (c) Strongly fixed (d) Tightly bound

Last Answer : (b) Loosely bounded

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

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

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

Last Answer : (D) None of the above

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

The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly coupled software and disk sharing, respectively. (B) Tightly coupled hardware on loosely coupled software and shared memory, respectively. (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

Description : The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly ... message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

Last Answer : (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. 

Distributed operating systems consist of: (1) Loosely coupled O.S. software on a loosely coupled hardware (2) Loosely coupled O.S. software on a tightly coupled hardware (3) Tightly coupled O.S. software on a loosely coupled hardware (4) Tightly coupled O.S. software on a tightly coupled hardware

Description : Distributed operating systems consist of: (1) Loosely coupled O.S. software on a loosely coupled hardware (2) Loosely coupled O.S. software on a tightly coupled hardware (3) Tightly coupled O.S. software on a loosely coupled hardware (4) Tightly coupled O.S. software on a tightly coupled hardware

Last Answer : Answer: 3

………………. Is a directed tree in which outdegree of each node is less than or equal to two. A) Unary tree B) Binary tree C) Dinary tree D) Both B and C

Description : ………………. Is a directed tree in which outdegree of each node is less than or equal to two. A) Unary tree B) Binary tree C) Dinary tree D) Both B and C

Last Answer : B) Binary tree

Polygons are translated by adding to the coordinate positionof each vertex and the current attribute setting. a.Straight line path b.Translation vector c.Differences d.Only b

Description : Polygons are translated by adding to the coordinate positionof each vertex and the current attribute setting. a.Straight line path b.Translation vector c.Differences d.Only b

Last Answer : d.Only b

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

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

Which equation represents a graph with a vertex at (1,-6?

Description : Which equation represents a graph with a vertex at (1,-6?

Last Answer : 7

What are the vertex and x-intercepts of the graph of the function below y x2 - 2x - 24?

Description : What are the vertex and x-intercepts of the graph of the function below y x2 - 2x - 24?

Last Answer : Need answer

What is the vertex of the graph of the function below y x2 plus 6x plus 5?

Description : What is the vertex of the graph of the function below y x2 plus 6x plus 5?

Last Answer : Need answer

What is the vertex of the graph of the function below y x2 - 8x plus 12?

Description : What is the vertex of the graph of the function below y x2 - 8x plus 12?

Last Answer : Need answer

Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Description : Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Last Answer : (B) PROLOG is a Strongly Typed Language.

Which of the following statement(s) is/are correct? (1) Persistence is the term used to describe the duration of phosphorescence. (2) The control electrode is used to turn the electron beam on and off. (3) The electron gun creates a source of electrons which are focussed into a narrow beam directed at the face of CRT. (4) All of the above.

Description : Which of the following statement(s) is/are correct? (1) Persistence is the term used to describe the duration of phosphorescence. (2) The control electrode is used to turn the electron beam on and off. (3) ... which are focussed into a narrow beam directed at the face of CRT. (4) All of the above. 

Last Answer : All of the above.

Path followed by water jet issuing from the bottom of a water tank will be a (A) Parabola (vertex being at the opening) (B) Hyperbola (C) Horizontal straight line (D) Zig-zag path (which is geometrically undefined)

Description : Path followed by water jet issuing from the bottom of a water tank will be a (A) Parabola (vertex being at the opening) (B) Hyperbola (C) Horizontal straight line (D) Zig-zag path (which is geometrically undefined)

Last Answer : (A) Parabola (vertex being at the opening)

How is the CH digraph pronounced?

Description : How is the CH digraph pronounced?

Last Answer : The "CH" is a consonant digraph and it pronounces like a J butin a voiceless tone. The examples are chair, chain, chat, chart,chin, chop, church, change, etc. This is a pretty common ... CH are charade, chute, parachute, chef,Michelle, Michigan, machine, chalet, champagne, chevron,chartreuse, etc.

What is Digraph blends?

Description : What is Digraph blends?

Last Answer : A digraph blend is when two consonants are paired together tocreate a sound that blends them together. A couple of Englishexamples are "ch" and "th."

Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Description : Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Last Answer : b) Directed graph

Which statement is not correct about “init” process in Unix? (1) It is generally the parent of the login shell. (2) It has PID 1. (3) It is the first process in the system. (4) Init forks and execs a ‘getty’ process at every port connected to a terminal.

Description : Which statement is not correct about “init” process in Unix? (1) It is generally the parent of the login shell. (2) It has PID 1. (3) It is the first process in the system. (4) Init forks and execs a ‘getty’ process at every port connected to a terminal.

Last Answer : It is the first process in the system.

In the head and neck: a. the lymph from the upper lid drains to the parotid and submandibular lymph nodes b. the facial nerve comes from the first pharyngeal arch c. branches of the ophthalmic division of the trigeminal nerve supply the skin of the scalp as far backward as the vertex d. the veins of the scalp are connected to both the diploic veins and the intracranial venous sinuses e. an unilateral cleft lip is a failure of the maxillary process to fuse with the medial nasal process

Description : In the head and neck: a. the lymph from the upper lid drains to the parotid and submandibular lymph nodes b. the facial nerve comes from the first pharyngeal arch c. branches of the ... e. an unilateral cleft lip is a failure of the maxillary process to fuse with the medial nasal process

Last Answer : branches of the ophthalmic division of the trigeminal nerve supply the skin of the scalp as far backward as the vertex

Force that acts on a body moving in a circu- lar path and is directed away from the centre is called?

Description : Force that acts on a body moving in a circu- lar path and is directed away from the centre is called?

Last Answer : Centrifugal force

Force which acts on a body moving in a circular path and it is directed towards centre is called?

Description : Force which acts on a body moving in a circular path and it is directed towards centre is called?

Last Answer : Centripetal force

147 A ray directed towards the centre of curvature of a spherical mirror a) become parallel to principal axis b)retraces its path c)appears to diverge from focus d)passes through focus.

Description : 147 A ray directed towards the centre of curvature of a spherical mirror a) become parallel to principal axis b)retraces its path c)appears to diverge from focus d)passes through focus.

Last Answer : b)retraces its path

For an object moving in uniform circular motion, the direction of the instantaneous acceleration vector is: w) tangent to the path of motion x) equal to zero y) directed radially outward z) directed radially inward

Description : For an object moving in uniform circular motion, the direction of the instantaneous acceleration vector is: w) tangent to the path of motion x) equal to zero y) directed radially outward z) directed radially inward

Last Answer : ANSWER: Z -- DIRECTED RADIALLY INWARD

Which of the following statements is not true of two genes that show 50% recombination frequency? (a) The gene show independent assortment. (b) If the genes are present on the same chromo- some, they undergo more than one cross-overs in every meiosis. (c) The genes may be on different chromosomes. (d) The genes are tightly linked.

Description : Which of the following statements is not true of two genes that show 50% recombination frequency? (a) The gene show independent assortment. (b) If the genes are present on the same chromo- some, they ... every meiosis. (c) The genes may be on different chromosomes. (d) The genes are tightly linked.

Last Answer : (b) If the genes are present on the same chromo- some, they undergo more than one cross-overs in every meiosis.

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

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.

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