You are an electrical engineer designing a new integrated circuit involving potentially millions of components Custom Essay

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.

2) Please answer the following question at this thread. Thanks!

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?

3) Please answer the following question at this thread. Thanks!

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.
4)
Please answer the following question at this thread. Thanks!

In Section 12.4 we learn about the Merge Sort algorithm; it is more efficient that the Bubble sort we learned about in Chapter 10. Doing some research on the Internet can you find a sorting algorithm more efficient than the Merge Sort? If you find one please describe it and list your reference.