Share
Explore BrainMass

Graph Theory and Parse Tree

1. Path Analysis
Here is a Question for you:
For the diagram below find all the "simple paths" from A to F.
A------------B------------C
| | / |
| | / |
| | / |
|D------------E------------F

2. Note a Hamiltonian circuit visits each vertex only once but may repeat edges. A Eulerian graph traverses every edge once, but may repeat vertice. Looking at the figure below tell me if they are Hamiltonian and/or Eulerian.
*-------*--------*
| / | |
| / | |
|/ | |
*-------*--------*

3. Graphs and Circuit Design
You are an electrical engineer designing a new integrated circuit involving potentially millions of components. How would you use graph theory to organize how many layers your chip must have to handle all of the interconnections, for example? Which properties of graphs come into play in such a circumstance?

4. Random Graphs
Random graphs are a fascinating subject of applied and theoretical research. These can be generated with a fixed vertex set V and edges added to the edge set E based on some probability model, such as a coin flip. Speculate on how many connected components a random graph might have if the likelihood of an edge (v1,v2) being in the set E is 50%. Do you think the number of components would depend on the size of the vertex set V? Explain why or why not

5. Trees and Language Processing
Trees occur in various venues in computer science: decision trees in algorithms, search trees, and so on. In linguistics, one encounters trees as well, typically as parse trees, which are essentially sentence diagrams, such as those you might have had to do in primary school, breaking a natural-language sentence into its components--clauses, subclauses, nouns, verbs, adverbs, adjectives, prepositions, and so on. What might be the significance of the depth and breadth of a parse tree relative to the sentence it represents? If you need to, look up parse tree and natural language processing on the Internet to see some examples.

Solution Preview

Please see the attachment.

Answer to 590945
Graph Theory and Trees
1. Path Analysis
Here is a Question for you:
For the diagram below find all the "simple paths" from A to F.
2. Note a Hamiltonian circuit visits each vertex only once but may repeat edges. A Eulerian graph traverses every edge once, but may repeat vertice. Looking at the figure below tell me if they are Hamiltonian and/or Eulerian.
3. Graphs and Circuit Design
You are an electrical engineer designing a new integrated circuit involving potentially millions of components. How would you use graph theory to organize how many layers your chip must have to handle all of the interconnections, for example? Which properties of graphs come into play in such a circumstance?
4. Random Graphs
Random graphs are a fascinating subject of applied and theoretical research. These can be generated with a fixed vertex set V and edges added to the edge set E based on some probability model, such as a coin flip. Speculate on how many connected components a random graph might have if the likelihood of an edge (v1,v2) being in the set E is 50%. Do you think the number of components would ...

Solution Summary

This solution offers to-the-point answers to some assorted questions on graph theory and parse tree.

$2.19