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

Graph used to represent semantic network is _____________

a) Undirected graph

b) Directed graph

c) Directed Acyclic graph (DAG)

d) Directed complete graph
by

1 Answer

Answer :

b) Directed graph
by

Related questions

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

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

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

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

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

Semantic grammars are _____________ a) Encode semantic information into a syntactic grammar b) Decode semantic information into a syntactic grammar c) Encode syntactic information into a semantic grammar d) Decode syntactic information into a semantic grammar

Description : Semantic grammars are _____________ a) Encode semantic information into a syntactic grammar b) Decode semantic information into a syntactic grammar c) Encode syntactic information into a semantic grammar d) Decode syntactic information into a semantic grammar

Last Answer : a) Encode semantic information into a syntactic grammar

What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Description : What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Last Answer : c) Both Logical term & Complete logical sentence

The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Description : The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Semantic Network is also known as Frame networks. a) True b) False

Description : Semantic Network is also known as Frame networks. a) True b) False

Last Answer : a) True

A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another. a) True b) False

Description : A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another. a) True b) False

Last Answer : a) True

Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks

Description : Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks

Last Answer : d) Partitioned Networks

The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False

Description : The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False

Last Answer : a) True

A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Description : A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Last Answer : c) Transition Network

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

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

_____________ 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

Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation? (A) Semantic network (B) Frames (C) Scripts (D) Conceptual Dependency

Description : Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation? (A) Semantic network (B) Frames (C) Scripts (D) Conceptual Dependency

Last Answer : (C) Scripts 

Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned

Description : Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned

Last Answer : b) Word Sense Disambiguation

The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. a) binary b) electro-chemical c) recursive d) semantic

Description : The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. a) binary b) electro-chemical c) recursive d) semantic

Last Answer : a) binary

Where does the dependance of experience is reflected in prior probability sentences? a) Syntactic distinction b) Semantic distinction c) Both Syntactic & Semantic distinction d) None of the mentioned

Description : Where does the dependance of experience is reflected in prior probability sentences? a) Syntactic distinction b) Semantic distinction c) Both Syntactic & Semantic distinction d) None of the mentioned

Last Answer : a) Syntactic distinction

What kind of interpretation is done by adding context-dependant information? a) Semantic b) Syntactic c) Pragmatic d) None of the mentioned

Description : What kind of interpretation is done by adding context-dependant information? a) Semantic b) Syntactic c) Pragmatic d) None of the mentioned

Last Answer : c) Pragmatic

What is the process of associating a FOL expression with a phrase? a) Interpretation b) Augmented reality c) Semantic interpretation d) Augmented interpretation

Description : What is the process of associating a FOL expression with a phrase? a) Interpretation b) Augmented reality c) Semantic interpretation d) Augmented interpretation

Last Answer : c) Semantic interpretation

What is the extraction of the meaning of utterance? a) Syntactic b) Semantic c) Pragmatic d) None of the mentioned

Description : What is the extraction of the meaning of utterance? a) Syntactic b) Semantic c) Pragmatic d) None of the mentioned

Last Answer : b) Semantic

There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

Like semantic networks, frames can be queried using spreading activation. a) True b) False

Description : Like semantic networks, frames can be queried using spreading activation. a) True b) False

Last Answer : a) True

Frames in artificial intelligence is derived from semantic nets. a) True b) False

Description : Frames in artificial intelligence is derived from semantic nets. a) True b) False

Last Answer : a) True

Most semantic networks are not cognitive based. a) True b) False

Description : Most semantic networks are not cognitive based. a) True b) False

Last Answer : b) False

What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints

Description : What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints

Last Answer : b) Lack in expressing some of the properties

Which of the following are the Semantic Relations used in Semantic Networks? a) Meronymy b) Holonymy c) Hyponymy d) All of the mentioned

Description : Which of the following are the Semantic Relations used in Semantic Networks? a) Meronymy b) Holonymy c) Hyponymy d) All of the mentioned

Last Answer : d) All of the mentioned

What are Semantic Networks? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned

Description : What are Semantic Networks? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned

Last Answer : a) A way of representing knowledge

Define Semantic Interpretation.

Description : Define Semantic Interpretation.

Last Answer :  The process of extracting the meaning of an utterance an expression in some representation language. 

Define Conflict directed back jumping.

Description : Define Conflict directed back jumping.

Last Answer : A back jumping algorithm that uses conflict sets defined in this way is called Conflict directed back jumping.

What does the bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Description : What does the bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Last Answer : a) Complete description of the domain

What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Description : What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Last Answer : a) Complete description of the domain

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

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

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

What is called as multiple connected graph?

Description : What is called as multiple connected graph?

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

______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned

Description : ______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned

Last Answer : d) All of the mentioned

Using logic to represent and reason we can represent knowledge about the world with facts and rules. a) True b) False

Description : Using logic to represent and reason we can represent knowledge about the world with facts and rules. a) True b) False

Last Answer : a) True

______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned

Description : ______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned

Last Answer : d) All of the mentioned