- {an} is a sequence of the form: an = an-1 + an-2, a0 = x, a1 = y
- There is a recursive algorithm to calculate an. Explain it, and show its complexity.
- [an, an-1]T can be expressed as a product of Q and [an-1, an-2]T, where Q = [ q11, q12 | q21, q22]. Calculate Q.
- Show an optimised algorithm for calculating an by using Q. Show its complexity.
- For x=1 and y=3, calculate a48
- {an,m} is a sequence where an,m = an-2,m + an-1,m mod m. Show {an,m} is cyclic.
- What is the period of an,3?
- There is a test by Alan Turing that determines the quality of artificial intelligence systems.
- What is its name?
- Describe it (in about 5 lines)
- In about 15 lines, describe its influence and criticisms, using these words:
Loebner prize, common sense, John Searle, speech recognition, Chinese Room, natural language processing, Eliza
- In C,
- define the sort function of signature:
void sort(int array[], int n)
. - for a structure
List { List *next, int v }
, define the reverse function of signature:List *reverse(List *list)
.
- define the sort function of signature:
I think I didn't do too badly. I'm pretty sure I aced the TOEFL two weeks ago, and that I'm over the threshold with the current offering. And if I am, I'll probably do well on the interview next week, since I'm told they'll be asking me about my research plan. And I know in quite a detail what I want to research. The quotas are not too bad either, despite what I thought before: 45 candidates for 19 places is not too bad. So even if I don't manage to pass, I'm satisfied that I did the best I could, and didn't make a monkey or a cabbage out of myself.
No comments:
Post a Comment