Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 23rd May 2013 Time: 09:45-11:45

Transcription

1 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Fundamentals of Computation Date: Thursday 23rd May 2013 Time: 09:45-11:45 Please answer any THREE Questions from the FOUR Questions provided. Use a SEPARATE answerbook for each SECTION. This is a CLOSED book examination The use of electronic calculators is NOT permitted [PTO]

2 Section A COMP a) Consider the language of all words over the alphabet {a,b,c} whose first letter, if it exists, is the same as its last letter. Give a description of this language via the following means. i) using a regular expression ii) using a DFA iii) using a grammar iv) using the language of set theory b) Give a DFA for the language of all words over the alphabet {a,b,c} that match the regular expression ab c a b c. (8 marks) c) Are the following languages over the alphabet {a, b, c} regular? Justify your answer. i) The language of all words whose number of symbols is divisible by three. ii) The language of all words such that the number of as in the word minus the number of cs in the word is divisible by three. Page 2 of 5

3 2. a) Consider the following grammar. The underlying alphabet is {a, b, c}, there is only one non-terminal symbol, S, and the production rules are S as cs cbs bcs ε. i) Show that this grammar is ambiguous by giving a word with two parse trees. Make sure you also draw the word s parse trees. (4 marks) ii) Describe the language generated by the grammar. iii) Give an unambiguous grammar for this language. Give an argument for your grammar being unambiguous. (4 marks) b) Consider the regular expression (a b) ab(a b) over the alphabet {a,b}. i) Describe the language consisting of all words that do not match the given regular expression without referring to that regular expression. ii) Give a DFA for the language from (i). c) Consider the language of balanced strings of brackets (, ), and square brackets [, ]. Such strings must have as many opening as closing brackets of each kind, when reading the string the number of closing brackets of either kind seen so far must not exceed the number of corresponding opening brackets and each closing bracket must match the rightmost opening bracket that has not yet been matched. i) Give a context-free grammar for this language. ii) Give parse trees for the strings ([][])[] and ([()[]]()). Page 3 of 5 [PTO]

4 Section B COMP a) State the principle of structural induction for finite lists b) Using structural induction, show that (++, []) is a monoid; i.e. the append operator ++ is associative, and that the empty list [] is both a left and right identity for ++. Append (++) is defined as: (++) :: [a] -> [a] -> [a] [] ++ ys = ys (x:xs) ++ ys = x: (xs ++ ys) c) Use structural induction to show that map f map g = map ( f g) Why do we need to use induction with to prove this equality? map :: (a -> b) -> [a] -> [b] map f [] = [] map f (x:xs) = f x: map f xs d) Explain the following concepts: computability, uncomputability, decidability, and semi-decidability. For each class of problem, give an example problem which is in the class. e) Show that the Halting Problem is undecidable; you need not give a full account of the universal program. f) Show that the problem of determining that a program halts is semi-decidable. Page 4 of 5

5 4. a) Explain the following concepts: pre-condition, post-condition, partial correctness, and loop-invariant with reference to the while language. b) Consider the following while program: r := 1; while (x > 0) do (r := r*y; x := x-1) Show that for some n and m: y = n n x r = m is a loop-invariant for the while loop. c) What is the value of r when the program from the previous part terminates? Using the loop invariant, prove your hypothesis. d) Explain why we use Big-O notation when discussing algorithmic efficiency. e) Using induction or otherwise, show that the factorial function fac: fac 0 = 1 fac (n+1) = (n+1) * fac n has time-complexity O(n). f) Why does the problem of binary search have a lower bound of O(logn)? Page 5 of 5 END OF EXAMINATION