Math221 Disscussion Question
Week 3/1
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? Which properties of graphs come into play in such a circumstance?
Week 3 /2
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.
Question #1
Suppose we are given the following programming segment:
Fx = 0
For x = 1 to x = n where n is a positive integer
Fx = x(x+3)+2
Print x
Next x
The reason for this question is to figure out the operation and the example is O(3n). in addition, the variable of the three operation is to calculate X(X+3)+2 with one more from X+3 then multiply X(X+3)+2. Thus, N is such as X for X goes to 1 to N. furthermore, now the total number of the operation has come to O(3n). in conclusion, O(3n) describe the many example of complexity of algorithm in the number of terms of the operation that run in this program.
\
This is going to be ruff to explain in a written example but here it goes. Its five week tell July and a person is in a hotdog eating contest. In addition, the person eats a total of 10 hot dog in a time manner. Next week the person eat 15 hotdog in the same time. So (x-1)*5+10 now how many can that person get eat before the contest. Thus, 95+10 would equal 105 hotdogs. Nevertheless, we could have done the formula this way
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? Which properties of graphs come into play in such a circumstance?
Week 3 /2
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.
Question #1
Suppose we are given the following programming segment:
Fx = 0
For x = 1 to x = n where n is a positive integer
Fx = x(x+3)+2
Print x
Next x
The reason for this question is to figure out the operation and the example is O(3n). in addition, the variable of the three operation is to calculate X(X+3)+2 with one more from X+3 then multiply X(X+3)+2. Thus, N is such as X for X goes to 1 to N. furthermore, now the total number of the operation has come to O(3n). in conclusion, O(3n) describe the many example of complexity of algorithm in the number of terms of the operation that run in this program.
\
This is going to be ruff to explain in a written example but here it goes. Its five week tell July and a person is in a hotdog eating contest. In addition, the person eats a total of 10 hot dog in a time manner. Next week the person eat 15 hotdog in the same time. So (x-1)*5+10 now how many can that person get eat before the contest. Thus, 95+10 would equal 105 hotdogs. Nevertheless, we could have done the formula this way