What is called as multiple connected graph?

What is called as multiple connected graph?
by

1 Answer

Answer :

A multiple connected graph is one in which two nodes are connected by more than one path. 
by

Related questions

A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. a) Decision tree b) Graphs c) Trees d) Neural Networks

Description : A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. a) Decision tree b) Graphs c) Trees d) Neural Networks

Last Answer : a) Decision tree

What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Last Answer : d) Decision tree

_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Last Answer : c) Graph-Plan

When will further expansion is unnecessary for planning graph? a) Identical b) Replicate c) Not identical d) None of the mentioned

Description : When will further expansion is unnecessary for planning graph? a) Identical b) Replicate c) Not identical d) None of the mentioned

Last Answer : a) Identical

Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Last Answer : a) Propositional planning problem

What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions

Description : What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions

Last Answer : d) Both Literals & Actions

What is the starting level of planning graph? a) Level 3 b) Level 2 c) Level 1 d) Level 0

Description : What is the starting level of planning graph? a) Level 3 b) Level 2 c) Level 1 d) Level 0

Last Answer : d) Level 0

Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned

Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned

Last Answer : c) Planning graph algorithm

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

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

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

What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Last Answer : d) Decision tree

How many ALU(s) is/are control by one control unit is SIMD (single instruction stream, multiple data stream) architecture? a) one or more ALUs b) One ALU c) Only two ALU d) Impossible to say

Description : How many ALU(s) is/are control by one control unit is SIMD (single instruction stream, multiple data stream) architecture? a) one or more ALUs b) One ALU c) Only two ALU d) Impossible to say

Last Answer : a) one or more ALUs

Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Description : Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Last Answer : b) Ockham razor

What can be viewed as a single lateral of disjunction? a) Multiple clause b) Combine clause c) Unit clause d) None of the mentioned

Description : What can be viewed as a single lateral of disjunction? a) Multiple clause b) Combine clause c) Unit clause d) None of the mentioned

Last Answer : c) Unit clause

Ambiguity may be caused by ______________ a) syntactic ambiguity b) multiple word meanings c) unclear antecedents d) all of the mentioned

Description : Ambiguity may be caused by ______________ a) syntactic ambiguity b) multiple word meanings c) unclear antecedents d) all of the mentioned

Last Answer : d) all of the mentioned

Third component of a planning system is to ___________ a) Detect when a solution has been found b) Detect when solution will be found c) Detect whether solution exists or not d) Detect whether multiple solutions exist

Description : Third component of a planning system is to ___________ a) Detect when a solution has been found b) Detect when solution will be found c) Detect whether solution exists or not d) Detect whether multiple solutions exist

Last Answer : a) Detect when a solution has been found

Neuron can send ________ signal at a time. A. multiple B. one C. none D. any number of

Description : Neuron can send ________ signal at a time. A. multiple B. one C. none D. any number of

Last Answer : B. one

Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Description : Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Last Answer : b) Ockham razor

Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. a) True – this works always, and these multiple perceptrons learn to classify even complex problems. b) False – perceptrons are mathematically incapable of solving linearly inseparable functions, no matter what you do c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded d) False – just having a single perceptron is enough

Description : Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. ... have to be explicitly hand-coded d) False - just having a single perceptron is enough

Last Answer : c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded

Narrow AI is performs multiple task at a time. A. True B. False

Description : Narrow AI is performs multiple task at a time. A. True B. False

Last Answer : B. False 

Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context? a) continuous speech recognition b) connected word recognition c) isolated word recognition d) speaker-dependent recognition

Description : Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context? a) continuous speech recognition b) connected word recognition c) isolated word recognition d) speaker-dependent recognition

Last Answer : c) isolated word recognition

Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a picture are connected or not a) (ii) and (iii) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Last Answer : a) (ii) and (iii) are true

Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Description : Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Last Answer : b) Fully connected

Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a picture are connected or not a) (ii) and (iii) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Last Answer : a) (ii) and (iii) are true

Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Description : Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Last Answer : b) Fully connected

53. While plotting constraints on a graph paper, terminal points on both the axes are connected by straight line because a. The resources are limited in supply b. The objective function as a linear function c. The constraints are linear equations or inequalities d. All of the above

Description : 53. While plotting constraints on a graph paper, terminal points on both the axes are connected by straight line because a. The resources are limited in supply b. The objective function as a linear function c. The constraints are linear equations or inequalities d. All of the above

Last Answer : c. The constraints are linear equations or inequalities

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

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

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)

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

A connected graph has ‘5’ number of branches and ‘4’ number of nodes. It's rank is

Description :  A connected graph has ‘5’ number of branches and ‘4’ number of nodes. It's rank is A) 1 B) 2 C) 3 D) 4 

Last Answer :  A connected graph has ‘5’ number of branches and ‘4’ number of nodes. It's rank is 3 

Will having multiple IDLE devices connected to a router still slow it down?

Description : Will having multiple IDLE devices connected to a router still slow it down?

Last Answer : Mostly routers don't handle 10 devices at once, at least the ones I am aware of, mostly. If they are sleeping, they might occasionally ping your system, but they shouldn't cause much of a slow down ... pretty good modem/router (300). You can go bigger, or smaller, and that will change your service.

Will a cell phone battery drain faster if it is connected to multiple bluetooth devices simultaneously?

Description : Will a cell phone battery drain faster if it is connected to multiple bluetooth devices simultaneously?

Last Answer : Probably as it is sending and receiving info from multiple sources.

Is it worth getting multiple hard-wired smoke detectors connected to an alarm system?

Description : Is it worth getting multiple hard-wired smoke detectors connected to an alarm system?

Last Answer : This is a tough question because it depends on how you feel about a very, very unlikely event (a fire starts at all, it is at the end of the house far from the central detector, we are ... wasted the money tying them all together. I suggest going with independent detectors and save some money, too.

Can I use multiple controllers with a USB hub connected to my PC?

Description : Can I use multiple controllers with a USB hub connected to my PC?

Last Answer : Yes if the game allows for multipul players.

Are there any adapters that allow multiple monitors to be connected to the same computer?

Description : Are there any adapters that allow multiple monitors to be connected to the same computer?

Last Answer : Yes.You can buy a splitter or use different types of connections.Most video cards have both a VGA and an HDMI slot,maybe even a S-Video slot.You can connect something to each of them.

. ____________ refers to distributed computing, in which a group of computers from multiple locations are connected with each other to achieve a common objective. A. Virtualization B. SOA C. Grid Computing D. Utility Computing Ans : C

Description : . ____________ refers to distributed computing, in which a group of computers from multiple locations are connected with each other to achieve a common objective. A. Virtualization B. SOA C. Grid Computing D. Utility Computing Ans : C

Last Answer : . Grid Computing

In wireless distribution system __________ a) multiple access point are inter-connected with each other b) there is no access point c) only one access point exists d) access points are not required

Description : In wireless distribution system __________ a) multiple access point are inter-connected with each other b) there is no access point c) only one access point exists d) access points are not required

Last Answer : a) multiple access point are inter-connected with each other

If the English Philosopher Thomas Hobbes could be called ‘grandfather’ of artificial intelligence, then who could be called its father? a) A.M. Turning b) John McCarthy c) Allen Newell d) Herbert Simon

Description : If the English Philosopher Thomas Hobbes could be called ‘grandfather’ of artificial intelligence, then who could be called its father? a) A.M. Turning b) John McCarthy c) Allen Newell d) Herbert Simon

Last Answer : a) A.M. Turning

Special programs that assist programmers are called ____________ a) heuristic processors b) symbolic programmers c) intelligent programming tools d) program recognizers

Description : Special programs that assist programmers are called ____________ a) heuristic processors b) symbolic programmers c) intelligent programming tools d) program recognizers

Last Answer : c) intelligent programming tools

Seymour Papert of the MIT AI lab created a programming environment for children called ___________ a) BASIC b) LOGO c) MYCIN d) FORTRAN

Description : Seymour Papert of the MIT AI lab created a programming environment for children called ___________ a) BASIC b) LOGO c) MYCIN d) FORTRAN

Last Answer : b) LOGO

DEC advertises that it helped to create “the world’s first expert system routinely used in an industrial environment,” called XCON or __________ a) PDP-11 b) Rl c) VAX d) MAGNOM

Description : DEC advertises that it helped to create “the world’s first expert system routinely used in an industrial environment,” called XCON or __________ a) PDP-11 b) Rl c) VAX d) MAGNOM

Last Answer : b) Rl

The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False

Description : The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False

Last Answer : a) True

What is called as the properties of the signal that extend over interval? a) Hops b) Rate c) Frames d) All of the mentioned

Description : What is called as the properties of the signal that extend over interval? a) Hops b) Rate c) Frames d) All of the mentioned

Last Answer : c) Frames