Like relational databases there does exists fuzzy relational databases. a) True b) False

Like relational databases there does exists fuzzy relational databases.

a) True

b) False
by

1 Answer

Answer :

a) True
by

Related questions

Like relational databases there does exists fuzzy relational databases. a) True b) False

Description : Like relational databases there does exists fuzzy relational databases. a) True b) False

Last Answer : a) True

____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Description : ____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B) Object-oriented databases store computational instructions in the same place as the data. (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases. (D) Object-oriented databases store more types of data than relational databases and access that data faster.

Description : Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B ... Object-oriented databases store more types of data than relational databases and access that data faster.

Last Answer : (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases.

Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai. a) True b) False

Description : Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai. a) True b) False

Last Answer : a) True

Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Last Answer : a) True

Membership function defines the fuzziness in a fuzzy set irrespective of the elements in the set, which are discrete or continuous. A. True B. False

Description : Membership function defines the fuzziness in a fuzzy set irrespective of the elements in the set, which are discrete or continuous. A. True B. False

Last Answer : B. False

Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai. a) True b) False

Description : Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai. a) True b) False

Last Answer : a) True

Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Last Answer : a) True

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

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Last Answer : a) True

Google cloud SQL Features a) Lets your application read files from and write files to buckets in Google cloud storage b) A Fully –managed web service that allows you to create , configure , and use relational databases that live in Google’s cloud c) Enables support for outbound sockets using the language – specific, built in libraries. d) Lets developers factor large applications into logical components that can be share stateful services and communicate in secure fashion.

Description : Google cloud SQL Features a) Lets your application read files from and write files to buckets in Google cloud storage b) A Fully -managed web service that allows you to create , ... large applications into logical components that can be share stateful services and communicate in secure fashion.

Last Answer : A Fully –managed web service that allows you to create , configure , and use relational databases that live in Google’s cloud

The first widely used commercial form of Artificial Intelligence (Al) is being used in many popular products like microwave ovens, automobiles and plug in circuit boards for desktop PCs. What is name of AI? A. Boolean logic B. Human logic C. Fuzzy logic D. Functional logic

Description : The first widely used commercial form of Artificial Intelligence (Al) is being used in many popular products like microwave ovens, automobiles and plug in circuit boards for desktop PCs. What is name of AI? A. Boolean logic B. Human logic C. Fuzzy logic D. Functional logic

Last Answer : C. Fuzzy logic 

Which method can’t be used for expressing relational knowledge? a) Literal system b) Variable-based system c) Attribute-based system d) None of the mentioned

Description : Which method can’t be used for expressing relational knowledge? a) Literal system b) Variable-based system c) Attribute-based system d) None of the mentioned

Last Answer : c) Attribute-based system

Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned

Description : Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned

Last Answer : b) Reflective

Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

Description : Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

Last Answer : c) Hybrid

Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned

Description : Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned

Last Answer : d) All of the mentioned

n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Last Answer : A. A measure of the desired maximal complexity of data mining algorithms

What are the stages in Relational based systems?

Description : What are the stages in Relational based systems?

Last Answer : i. tokenization  ii. Complex word handling iii. Basic groups iv. Complex phrases v. Merges structures

Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail somewhere between 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Description : Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail ... 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Last Answer : b) Fuzzy logic

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

How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach

Description : How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach

Last Answer : a) IF and THEN Approach

______________ 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

Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules

Description : Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules

Last Answer : b) IF-THEN rules

There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned

Description : There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned

Last Answer : a) Hedges

Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators from the following. a) AND b) OR c) NOT d) All of the mentioned

Description : Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators from the following. a) AND b) OR c) NOT d) All of the mentioned

Last Answer : d) All of the mentioned

The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ a) Fuzzy Set b) Crisp Set c) Fuzzy & Crisp Set d) None of the mentioned

Description : The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ a) Fuzzy Set b) Crisp Set c) Fuzzy & Crisp Set d) None of the mentioned

Last Answer : a) Fuzzy Set

The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0 & 1 d) Either 0 or 1, either 0 or 1

Description : The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0 & 1 d) Either 0 or 1, either 0 or 1

Last Answer : a) Either 0 or 1, between 0 & 1

What is the form of Fuzzy logic? a) Two-valued logic b) Crisp set logic c) Many-valued logic d) Binary set logic

Description : What is the form of Fuzzy logic? a) Two-valued logic b) Crisp set logic c) Many-valued logic d) Binary set logic

Last Answer : c) Many-valued logic

How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach

Description : How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach

Last Answer : a) IF and THEN Approach

The crossover points of a membership function are defined as the elements in the universe for which a particular fuzzy set has values equal to A. infinite B. 1 C. 0 D. 0.5

Description : The crossover points of a membership function are defined as the elements in the universe for which a particular fuzzy set has values equal to A. infinite B. 1 C. 0 D. 0.5

Last Answer : D. 0.5

The membership values of the membership function are nor strictly monotonically increasing or decreasing or strictly monoronically increasing than decreasing. A. Convex Fuzzy Set B. Non convex fuzzy set C. Normal Fuzzy set D. Sub normal fuzzy set

Description : The membership values of the membership function are nor strictly monotonically increasing or decreasing or strictly monoronically increasing than decreasing. A. Convex Fuzzy Set B. Non convex fuzzy set C. Normal Fuzzy set D. Sub normal fuzzy set

Last Answer : B. Non convex fuzzy set

A fuzzy set has a membership function whose membership values are strictly monotonically increasing or strictly monotonically decreasing or strictly monotonically increasing than strictly monotonically decreasing with increasing values for elements in the universe A. convex fuzzy set B. concave fuzzy set C. Non concave Fuzzy set D. Non Convex Fuzzy set

Description : A fuzzy set has a membership function whose membership values are strictly monotonically increasing or strictly monotonically decreasing or strictly monotonically increasing than strictly monotonically decreasing with increasing ... fuzzy set C. Non concave Fuzzy set D. Non Convex Fuzzy set

Last Answer : A. convex fuzzy set

A fuzzy set wherein no membership function has its value equal to 1 is called A. normal fuzzy set B. subnormal fuzzy set. C. convex fuzzy set D. concave fuzzy set

Description : A fuzzy set wherein no membership function has its value equal to 1 is called A. normal fuzzy set B. subnormal fuzzy set. C. convex fuzzy set D. concave fuzzy set

Last Answer : B. subnormal fuzzy set.

In a Fuzzy set a prototypical element has a value A. 1 B. 0 C. infinite D. Not defined

Description : In a Fuzzy set a prototypical element has a value A. 1 B. 0 C. infinite D. Not defined

Last Answer : A. 1

The region of universe that is characterized by complete membership in the set is called A. Core B. Support C. Boundary D. Fuzzy

Description : The region of universe that is characterized by complete membership in the set is called A. Core B. Support C. Boundary D. Fuzzy

Last Answer : A. Core

Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median

Description : Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median

Last Answer : C. Core, Support , Boundary

Conventional Artificial Intelligence is different from soft computing in the sense A. Conventional Artificial Intelligence deal with prdicate logic where as soft computing deal with fuzzy logic B. Conventional Artificial Intelligence methods are limited by symbols where as soft computing is based on empirical data C. Both (a) and (b) D. None of the above

Description : Conventional Artificial Intelligence is different from soft computing in the sense A. Conventional Artificial Intelligence deal with prdicate logic where as soft computing deal with fuzzy logic B. Conventional Artificial ... empirical data C. Both (a) and (b) D. None of the above

Last Answer : C. Both (a) and (b

Fuzzy Computing A . mimics human behaviour B. doesnt deal with 2 valued logic C. deals with information which is vague, imprecise, uncertain, ambiguous, inexact, or probabilistic D . All of the above

Description : Fuzzy Computing A . mimics human behaviour B. doesnt deal with 2 valued logic C. deals with information which is vague, imprecise, uncertain, ambiguous, inexact, or probabilistic D . All of the above

Last Answer : D . All of the above

Core of soft Computing is A. Fuzzy Computing, Neural Computing, Genetic Algorithms B. Fuzzy Networks and Artificial Intelligence C. Artificial Intelligence and Neural Science D. Neural Science and Genetic Science

Description : Core of soft Computing is A. Fuzzy Computing, Neural Computing, Genetic Algorithms B. Fuzzy Networks and Artificial Intelligence C. Artificial Intelligence and Neural Science D. Neural Science and Genetic Science

Last Answer : D. Neural Science and Genetic Science

How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach e) Else If approach

Description : How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach e) Else If approach

Last Answer : a) IF and THEN Approach

______________ 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

Fuzzy logic is usually represented as a) IF-THEN-ELSE rules b) IF-THEN rules c) Both a & b d) None of the mentioned

Description : Fuzzy logic is usually represented as a) IF-THEN-ELSE rules b) IF-THEN rules c) Both a & b d) None of the mentioned

Last Answer : b) IF-THEN rules

There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentione

Description : There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentione

Last Answer : a) Hedges

Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators from the following. a) AND b) OR c) NOT d) EX-OR

Description : Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators from the following. a) AND b) OR c) NOT d) EX-OR

Last Answer : a) AND b) OR c) NOT

The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ . a) Fuzzy Set b) Crisp Set

Description : The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ . a) Fuzzy Set b) Crisp Set

Last Answer : a) Fuzzy Set

The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0

Description : The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0

Last Answer : a) Either 0 or 1, between 0 & 1

Fuzzy logic is a form of a) Two-valued logic b) Crisp set logic c) Many-valued logic d) Binary set logic

Description : Fuzzy logic is a form of a) Two-valued logic b) Crisp set logic c) Many-valued logic d) Binary set logic

Last Answer : c) Many-valued logic

Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Last Answer : b) The entire tree so far been generated must be stored in BFS

An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Description : An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Last Answer : b) It is guaranteed to return an optimal solution when one exists