walaa

Thank you cemaneg. However I was asking about Gatech's CS - PhD decisions. Any news friends?

Hasn't anybody heard from GTech yet? When we should hear? @Ickr Are you applying for PhD CS? How did you hear your decision?

I filled the Graduate School Online Application. Is there an application that is special to the CS Department? There is something else regarding Minnesota TC CS application. I could not find the recommendation letters form, either online or in paper format. Have you?

This means that III is true, right?

Of course, If had the answer I would have posted it. The file that I have does not contain the answers. Why do you believe that III is worng?

I think III is true. L is undecidable -> A Turing Machine will not be able to reject a string that is not in L -> A Turing Machine will not be able to accept a string that is in L' -> L' is undecidable. What do you think Angelina?

L is an undecidable language (i.e. not recursive). Which of the following statements are correct. I. L is infinte. II. L contains a recursive language. III. L' is undecidable. a) I only b) I and II c) I and III d) II and III e) I,II,III

Relative error = Error / Actual value. Error = Actual Value - Represented value.

This question appeared on the Nov. 2001 test. I do not have the answer.

Suppose the statement X: =(-B+SQRT(B*B-4*A*C))/(2*A) is used with floating-point arithmetic to compute an approximate solution to the quadratic equation Ax2+Bx+C=0. If no overflow or underflow occurs, if A>0 and C>=0,then the result may have a large relative error which of the following circumstances? I. B is positive and B2 is much larger than 4AC II. B is negative and B2 is much larger than 4AC. III. B=C=0 (A) I only (B) II only © III only (D) I and II (E) II and III