As the earlier version of the qualifying exam has been shared with Ph.D. candidates from year to year, this year’s exam is all new.
Prove or disprove the Nostratic hypothesis. Cite examples from at least 10 potential sub-
Sketch out an algorithm for a sentence parser that runs in O(n·log(log((n))) or better time, and uses no more than O(m) memory, where
• n = the number of noun phrases in the sentence, and
• m = the number of UTF-16 bytes in the Hittite translation of the sentence
Why? Why not?
(Provide answers in at least two substantively different dialects of English, Dutch, and Indonesian, and all three dialects of Romulan.)
day oo- yay eak- spay Ig- Pay Atin- Lay?
day as- lay I- yay ay- say, ot- nay as- lay I- yay oo- day.
yay, æh- yay!
hay akes- tay a- yay ake- stay.