Disscussion Question

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 n 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 o in primary school, breaking a natural-language sentence into its components? clauses, subclasses, 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: Fix=O For x = 1 tax= n where n Is a positive integer Print x Next x The reason for this question is to figure out the operation and the example Is O(an). N addition, the variable of the three operation Is to calculate with one more from X+3 then multiply 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(an). In conclusion, O(an) 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 hotdogs eating contest. In Dalton, the person eats a total of 10 hot dog In a time manner. Next week the person eat 15 hotdogs In the same time. So (X-I 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 5 then the last 25 hotdogs plus 5 etc. Till it equal 105 110+5 For x = 1 to x = n where n is a positive integer Describe an induction process. How does induction process differ from a process of simple repetition?

I must say I agree about the definition of how to negate a statement. The way I see It doesn’t matter whether the statement is true or false; we still consider it to be statement. Nevertheless, It’s an equation or sentence or a declaration. In addition, a statement is pretty much what it sounds like it should be. I like the way you but that last sentence. Nevertheless, It’s an equation or sentence or a declaration. Thus, the way you end the response with “It doesn’t matter whether the statement is true or false; we still consider it to be a statement”.

I must say I agree about not really knowing the way petrifaction work with teacher. After reading you discussion question about the example being about finding a candidate for being a teacher. In addition, the way you made the example about the candidate having one year with degree or two year with certification was great. When looking for a certain Job that requires at least two years of experience in teaching K-12, plus having a teaching certification or graduate degree. There is a couple way to look at this posting, that the teacher can have 1 year with the graduate degree, 2 year with a teaching certification, or vice versa.

This would open it to many different types of applicant they could get for one Job posting to get a good being 24 months, then C and D are equal. First Message – Week 2 – Question 1 Suppose a Job posting states, “Applicants must have one to two years teaching experience in K-12 and a teaching certification or have a graduate degree. ” Could you interpret this Job description in different ways? Why or why not? Use propositional logic, set theory or Venn diagrams as support. First Message – Week 2 – Question 2 Find the NEGATION of each of the following statements: a) John is tall and likes to bike. ) Mike will laugh or cry tomorrow. C) Mary drives or carpools to work. D) Allison is intelligent and witty. What happens to the “and” or the “or” with the negation? Why? A) – John is NOT tall or he does NOT like to bike. B)- Mike will NOT laugh and will NOT cry tomorrow. C) – Mary does NOT drive and does NOT carpool to work. D)- Allison is NOT intelligent or witty. “And” is replaced with “or” and “or” is replaced with “and”. In this question they want the person to find the negation of each of the following four statement.

In addition, the question also suggest the issue of what happens to the “and” or the “or” with the negation. Thus, to be able to find the negation of the following four statement the person must find the “and” in the statement. For example, “John is tall AND likes to bike”, by identifying “and” the person would simply have to make half statement negative to make the statement a negation. Now, by applying this formula for finding negation in a statement the person would now apply the word “not” in the following statement by replacing “and”. Derailing the following statement into a negation.

This question has made myself come to a riddle that apply to this in a manner, I think? Furthermore, the logician points to one of the roads and says to the native, “If I were to ask if this road leads to the village, would you say ‘yes? The native is forced to give the right answer, even if he is a liar! If the road does lead to the village, the liar would say, “No” to the direct question, but as the question is put, he lies and says he would reply, “Yes”. Thus the logician can be certain that the road does lead to the village, whether the respondent is a truth-teller or a liar.

On the other hand, if the road actually does not go to the village, the liar is forced in the same way to say, “No” to the question. Look at it from a math view. 1+1=2 and 2+2=4 (since they are both correct that would be a truth). If you change one of the equations as below: +1=3 and 2+2=4 and the question is still asking True or False both equations below are correct. Since only one equation would have to be False to make the entire problem false you can look at the problems independently of each other (changing the “and” to “or”). Since 1+1<>3 the entire problem is rendered False (negated).

Now if you have a statement where there is an or in the statement to negate it you have to make both sides of it False. Same formulas as before: 1+1=2 or 2+2=4 True or False at least one of these equations is correct. Since you only need one to be correct the math holds regardless if you make 1+1=3 ND 2+2=4 or 1+1=2 and 2+2=5 – either combination at least one is correct so the statement is truthful. However, to make it false both equations would have to be incorrect and since they have to be evaluated together you need to replace “or” with “and”.

If they are both made to be incorrect then the True or False at least one of these equations is correct for the below equations: 1+1=3 and 2+2=5 since both are incorrect the answer is False and therefore it is negated. Suppose you are organizing a business meeting and are in charge of facilitating the introductions. How would you arrange a group of people so each person can shake hands with every other person? How might you organize this process? How many times will each person shake hands with someone else? How many handshakes will occur?

How must your method vary according to whether or not n is even or odd? Now if I was the one organizing a meeting for a business and had to arrange the out the answer about the number of people and how many times they would shake each other hands. Thus. Knowing the formula to figure it out to get the answer would be the combination formula. Furthermore, the equation would be ICC=(35! /(33! *2)=35*34/2=595, which it mean the 1st person will shake 34 hands. Thus, the 2nd person would shake 33 hands and so on and so forth. In conclusion, the number would end up as an odd number 595.

A lot of people had the right answer of 595. The actual way to get it is to use the Combinations formula. The general formula is NC = m! / ((m-n)! * n! ) n! Means to multiply the number by every number from one to itself. The convenient thing is that most of the terms cancel out. When you are choosing two, it becomes very simple. Every cancels out to m * (m-1)/2 You are choosing 2 from 35, so ICC = (35! ) / (33! * 2! ) = 35 * 34/2= 595 Edit: A lot of people here need to go back to math class. Sad (the guy right before me) is correct.

Cutie is also correct, but used a different approach to get the right answer. The first person shakes 34 hands, the second shakes an additional 33, etc. Isn’t math neat! Different ways to get the same correct answer. Joule’s 35! Is the number of ways you can arrange 35 people in a row. It has nothing to do with shaking hands. Do not give him the best answer. He’s not even close. Mohammed was close, except that it is N * (N -1) / 2. Even so, his arithmetic was not correct. Look up “combinations and permutations” and you will find many similar problems.

It’s the same formula as choosing lottery numbers. I recently had a meeting at a restaurant. There were four of us waiting to be seated. Shortly after we arrived. The four of sat briefly and talked about the weather and sports during the brief wait for a seat. Soon the hostess came and told us our table was ready. At this time I made it a point to give the formal introduction and asked that each one of us shake hands and introduce yourself directly to one another. By the time the time we all had shake hands altogether hands were shaken six times.

This occurs because with four people it will be 3*2*1=6. Please forgive my answer earlier I mean 6. Will definitely slow it down. Thanks. Week What is the difference between a permutation and a combination? What are some practical examples of when you would use each? Well the definition of permutation is the arrangement of object in some specific order. In addition, permutations are also regarded as ordered elements that are selected in which order is not important is called a combination. Furthermore, combinations are known to be regarded as sets.

Thus, there is three different colored balls, now there are groups of two balls selected from it will be considered as a combination. In conclusion, the two are always as different as their arrangement of every combination will be considered figure out which turn on the three light in a other room. In addition, the person can only go once in the room. Suppose there are 3 doors in a room, 2 on one side and 1 on other side. A man want to go out from the room.