List the scqucticc of steps necessary for a Genet ic Algorithm Choose one of Kar

Question

List the scqucticc of steps necessary for a Genet ic Algorithm Choose one of Karp's 21 NP-hard problems. Describe the data structure(s) and tint's function(s) necessary to apply the Genctic Algorithm to it. A) W hat is the difference between a genetic algorithm and genetic programming^ approach? B) What are the differences between a data tree and an expression tree ) Describe an application where a data tree would be used. D) Describe an application where an expression tree w ould be used. Describe a) preorder traversals, b) depth-first searches and c) backtracking approaches Why arc they similar when applied to data trees? A) Describe a mechanism to encode a tree as an one-dimensional array. B) What famous searching or sorting technique utilizes this technology? C) Which traversal of the nodes of a complete binary tree most closely reveals this technology? D) How can this be used to generate a random binary tree structure?

Explanation / Answer

hope all the links and matter will help you........please do rate.......please

http://www.mathworks.in/help/gads/how-the-genetic-algorithm-works.html

http://goanna.cs.rmit.edu.au/~vc/papers/matsah-seal08.pdf

A binary expression tree is a specific application of a binary tree to evaluate certain expressions. Two common types of expressions that a binary expression tree can represent are algebraic[1] and boolean. These trees can represent expressions that contain both unary and binary operators.[1]

In general, expression trees are special kind of binary trees. A binary tree is a tree in which all nodes contain zero, one or two children. This restricted structure simplifies the programmatic processing of Expression trees.

In computer science, a tree is a widely used abstract data type (ADT) or data structure implementing this ADT that simulates a hierarchicaltree structure, with a root value and subtrees of children, represented as a set of linked nodes.

A tree data structure can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.

Alternatively, a tree can be defined abstractly as a whole (globally) as an ordered tree, with a value assigned to each node. Both these perspectives are useful: while a tree can be analyzed mathematically as a whole, when actually represented as a data structure it is usually represented and worked with separately by node (rather than as a list of nodes and an adjacency list of edges between nodes, as one may represent a digraph, for instance). For example, looking at a tree as a whole, one can talk about "the parent node" of a given node, but in general as a data structure a given node only contains the list of its children, but does not contain a reference to its parent (if any).

Applications of tree data structure

Difficulty Level: Rookie

Why Tree?
Unlike Array and Linked List, which are linear data structures, tree is hierarchical (or non-linear) data structure.

1) One reason to use trees might be because you want to store information that naturally forms a hierarchy. For example, the file system on a computer:

file system

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.