Explain expert system, Data Structure & Algorithms

1. What is an expert system and where are they needed?

2. What are the major issues involved in building an expert system?

 

Posted Date: 3/15/2013 2:57:56 AM | Location : United States







Related Discussions:- Explain expert system, Assignment Help, Ask Question on Explain expert system, Get Answer, Expert's Help, Explain expert system Discussions

Write discussion on Explain expert system
Your posts are moderated
Related Questions
What is a Binary Search Tree (BST)? A binary search tree B is a binary tree every node of which satisfies the three conditions: 1.  The value of the left-subtree of 'x' is le

Importance of Object-Oriented over java Java is basically based on OOP notions of classes and objects. Java uses a formal OOP type system that should be obeyed at compile-t

Define about the class invariant A class invariant may not be true during execution of a public operation though it should be true between executions of public operations. For

Prepare a GUI called Hotplate GUI that holds a central panel that draws a rectangular grid that represents Element objects which should be held in a 2-dimensional array. The applic

Efficiency of Linear Search How much number of comparisons is there in this search in searching for a particular element? The number of comparisons based upon where the reco

Dequeue (a double ended queue) is an abstract data type alike to queue, where insertion and deletion of elements are allowed at both of the ends. Like a linear queue & a circular q

Ask question #Minimum 1Mark each of the following statements as valid or invalid. If a statement is invalid, explain why. a. current ¼ list; b. temp->link->link ¼ NULL; c. trail->l

What are expression trees?  The leaves of an expression tree are operands, like as constants or variable names, and the other nodes have operators. This certain tree happens to

the voltage wave forms are applied at the inputs of an EX-OR gate. determine the output wave form

Algorithm for determining strongly connected components of a Graph: Strongly Connected Components (G) where d[u] = discovery time of the vertex u throughout DFS , f[u] = f