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

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
by

1 Answer

Answer :

A.
A measure of the desired maximal complexity of data mining algorithms
by

Related questions

................. is subject oriented, integrated, time variant, non-volatile collection of data in support of management decisions. (A) Data mining (B) Web mining (C) Data warehouse (D) Database Management System

Description : ................. is subject oriented, integrated, time variant, non-volatile collection of data in support of management decisions. (A) Data mining (B) Web mining (C) Data warehouse (D) Database Management System

Last Answer : (C) Data warehouse

____________ 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

RDBMS provides relational operators to manipulate the data. Here, RDBMS refers to (a) Record Database Management System -Technology

Description : RDBMS provides relational operators to manipulate the data. Here, RDBMS refers to (a) Record Database Management System -Technology

Last Answer : (b) RDBMS stands for Relational Database Management System, which provides the operator to manipulate the data stored in the database table.

Which will solve the conjuncts of the rule so that the total cost is minimized? a) Constraint variable b) Conjunct ordering c) Data complexity d) All of the mentioned

Description : Which will solve the conjuncts of the rule so that the total cost is minimized? a) Constraint variable b) Conjunct ordering c) Data complexity d) All of the mentioned

Last Answer : b) Conjunct ordering

Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Last Answer : d) Heap sort

What is Relational Database Management System ?

Description : What is Relational Database Management System ?

Last Answer : Database databases are organized in different rows, that is, files are considered only in records, but also in tables with list rows and columns. This type of database is called relational database management system.

Which of the following genres does Hadoop produce? a) Distributed file system b) JAX-RS c) Java Message Service d) Relational Database Management System

Description : Which of the following genres does Hadoop produce? a) Distributed file system b) JAX-RS c) Java Message Service d) Relational Database Management System

Last Answer : Distributed file system

Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential

Description : Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential 

Last Answer : (D) Sequential

Expansion of RDBMS is (1) Repairable Database Management System (2) Relational Database Management System (3) Relational Database Memory System (4) Recurring Database Memory System

Description : Expansion of RDBMS is (1) Repairable Database Management System (2) Relational Database Management System (3) Relational Database Memory System (4) Recurring Database Memory System 

Last Answer : Relational Database Management System

The process of removing detail from a given state representation is called ______ a) Extraction b) Abstraction c) Information Retrieval d) Mining of data

Description : The process of removing detail from a given state representation is called ______ a) Extraction b) Abstraction c) Information Retrieval d) Mining of data

Last Answer : b) Abstraction

Which of the following is not an application of learning? a) Data mining b) WWW c) Speech recognition d) None of the mentioned

Description : Which of the following is not an application of learning? a) Data mining b) WWW c) Speech recognition d) None of the mentioned

Last Answer : d) None of the mentioned

A relational database management (RDBM) package manages datain morethan one file at once. How does itorganizethese file? As A. tables B. relations C. tuple D. both (a)and (b) E. None of the above

Description : A relational database management (RDBM) package manages datain morethan one file at once. How does itorganizethese file? As A. tables B. relations C. tuple D. both (a)and (b) E. None of the above

Last Answer : both (a)and (b)

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

Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False

Description : Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False

Last Answer : a) True

Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic

_____________ 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 can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Description : Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Last Answer : a) Most-constrained variable

General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Last Answer : d) All of the mentioned

Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space

Description : Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space

Last Answer : d) Less memory & Finds a solution in large infinite space

Distinguish between A* and AO* algorithms?

Description : Distinguish between A* and AO* algorithms?

Last Answer : Ans:- A* algorithm:-  A* uses a best-first search and finds the least-cost path from a given initial node to one goal node (out of one or more possible goals).  It uses a distance-plus- ... node as SOLVED.  If starting node is SOLVED or value greater than FUTILITY, stop, else repeat from 2.

Which of the following(s) is/are found in Genetic Algorithms? (i) evolution (ii) selection (iii) reproduction (iv) mutation (a) i & ii only (b) i, ii & iii only (c) ii, iii & iv only

Description : Which of the following(s) is/are found in Genetic Algorithms? (i) evolution (ii) selection (iii) reproduction (iv) mutation (a) i & ii only (b) i, ii & iii only (c) ii, iii & iv only

Last Answer : (a) i & ii only

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

Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. Decision support systems that contain an information base filled with the knowledge of an expert formulated in terms of if-then rules. D . None of these

Description : Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. ... the knowledge of an expert formulated in terms of if-then rules. D . None of these

Last Answer : B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution.

Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base filled with the knowledge of an expert formulated in terms of if-then rules D . None of these

Description : Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base ... the knowledge of an expert formulated in terms of if-then rules D . None of these

Last Answer : C. an information base filled with the knowledge of an expert formulated in terms of if-then rules

What are the algorithms to have efficient parsing?

Description : What are the algorithms to have efficient parsing?

Last Answer : i. Left to right parsing algorithm  ii. Chart Parsing algorithm.  iii. Left corner parsing

What is Genetic Algorithms?

Description : What is Genetic Algorithms?

Last Answer : Genetic Algorithm is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.

What are the 2 types of memory bounded heuristic algorithms?

Description : What are the 2 types of memory bounded heuristic algorithms?

Last Answer : i. Recursive Best First Search(RBFS)  ii. Memory bounded A*(MA*)

Deep learning is a subfield of machine learning where concerned algorithms are inspired by the structured and function of the brain called _____. A. Machine learning B. Artificial neural networks C. Deep learning D. Robotics

Description : Deep learning is a subfield of machine learning where concerned algorithms are inspired by the structured and function of the brain called _____. A. Machine learning B. Artificial neural networks C. Deep learning D. Robotics

Last Answer : B. Artificial neural networks 

What is the name of the computer program that contains the distilled knowledge of an expert? a) Database management system b) Management information System c) Expert system d) Artificial intelligence

Description : What is the name of the computer program that contains the distilled knowledge of an expert? a) Database management system b) Management information System c) Expert system d) Artificial intelligence

Last Answer : c) Expert system

The following is not a feature of competitive antagonists: A. Chemical resemblance with the agonist B. Parallel rightward shift of the agonist log doseresponse curve C. Suppression of maximal agonist response D. Apparent reduction in agonist affinity for the receptor

Description : The following is not a feature of competitive antagonists: A. Chemical resemblance with the agonist B. Parallel rightward shift of the agonist log doseresponse curve C. Suppression of maximal agonist response D. Apparent reduction in agonist affinity for the receptor

Last Answer : C. Suppression of maximal agonist response

A drug which does not produce any action by itself but decreases the slope of the log dose-response curve and suppresses the maximal response to another drug is a: A. Physiological antagonist B. Competitive antagonist C. Noncompetitive antagonist D. Partial agonist

Description : A drug which does not produce any action by itself but decreases the slope of the log dose-response curve and suppresses the maximal response to another drug is a: A. Physiological antagonist B. Competitive antagonist C. Noncompetitive antagonist D. Partial agonist

Last Answer : C. Noncompetitive antagonist

A drug ‘R’ producing no response by itself causes the log dose-response curve of another drug ‘S’ to shift to the right in a parallel manner without decreasing the maximal response: Drug ‘R’ is a: A. Partial agonist B. Inverse agonist C. Competitive antagonist D. Noncompetitive antagonist

Description : A drug ‘R’ producing no response by itself causes the log dose-response curve of another drug ‘S’ to shift to the right in a parallel manner without decreasing the maximal response: Drug ‘R’ is a: A. Partial agonist B. Inverse agonist C. Competitive antagonist D. Noncompetitive antagonist

Last Answer : C. Competitive antagonist

The following is not a feature of competitive antagonists: A. Chemical resemblance with the agonist B. Parallel rightward shift of the agonist log doseresponse curve C. Suppression of maximal agonist response D. Apparent reduction in agonist affinity for the receptor

Description : The following is not a feature of competitive antagonists: A. Chemical resemblance with the agonist B. Parallel rightward shift of the agonist log doseresponse curve C. Suppression of maximal agonist response D. Apparent reduction in agonist affinity for the receptor

Last Answer : C. Suppression of maximal agonist response

A drug which does not produce any action by itself but decreases the slope of the log dose-response curve and suppresses the maximal response to another drug is a: A. Physiological antagonist B. Competitive antagonist C. Noncompetitive antagonist D. Partial agonist

Description : A drug which does not produce any action by itself but decreases the slope of the log dose-response curve and suppresses the maximal response to another drug is a: A. Physiological antagonist B. Competitive antagonist C. Noncompetitive antagonist D. Partial agonist

Last Answer : C. Noncompetitive antagonist

A drug ‘R’ producing no response by itself causes the log dose-response curve of another drug ‘S’ to shift to the right in a parallel manner without decreasing the maximal response: Drug ‘R’ is a: A. Partial agonist B. Inverse agonist C. Competitive antagonist D. Noncompetitive antagonist

Description : A drug ‘R’ producing no response by itself causes the log dose-response curve of another drug ‘S’ to shift to the right in a parallel manner without decreasing the maximal response: Drug ‘R’ is a: A. Partial agonist B. Inverse agonist C. Competitive antagonist D. Noncompetitive antagonist

Last Answer : C. Competitive antagonist

Which of the following is an edge-storage or content-delivery system that caches data in different physical locations? a) Amazon Relational Database Service b) Amazon SimpleDBc) Amazon Cloudfront d) Amazon Associates Web Services

Description : Which of the following is an edge-storage or content-delivery system that caches data in different physical locations? a) Amazon Relational Database Service b) Amazon SimpleDB c) Amazon Cloudfront d) Amazon Associates Web Services

Last Answer : Amazon Cloudfront

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

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

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

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

Computational learning theory analyzes the sample complexity and computational complexity of __________ a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning

Description : Computational learning theory analyzes the sample complexity and computational complexity of __________ a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning

Last Answer : b) Inductive learning

Which makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check

Description : Which makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check

Last Answer : d) Occur check

Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4

Description : How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False

Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False

Last Answer : a) True