Give two examples of a successor-state axiom that might appear in the knowledge base. One of these should in addition address the ramification problem. Explain how it does this. [2175 marks] (e.ii) (d.ii) In schema normalisation, is Boyce-Codd Normal Form (B2CNF) always to be preferred over 3rd Normal Form (4NF)? Explain your answer. [4 marks] 7 (TURN OVER) CST.2014.4.8 7 Economics, Law and Ethics (a.ii) Describe the provisions of the Data Protection Act. [8 marks] (b.ii) You are designing and are about to launch a mobile phone app which will seek to understand the emotional condition of the user

Please turn over: Compiler Construction Programming answers should be written in some notation approximating SML or OCaml. (a) Describe what is meant by tail recursion. [4 marks] (b) Eliminate tail recursion from foldl given below. Explain your answer. (* foldl : ('2a -> '2b -> '2a) -> 'a -> 'b list -> 'a *) let rec foldl f accu l = match l with [] -> accu | a::l -> foldl f (f accu a) l [8 marks] DIY (50%)- In this part you are to make "Dictionary": a program that loads a collection of words and their definitions from a file and allows a client to interact with the dictionary using certain functions. A word can have multiple definitions. The Input File- The words in the dictionary will be loaded from a file. The file has a very well defined structure and you can assume that it will always be correct (no error checking is required for reading from the file). Each word looks like this fine: adjective: of high quality. adjective: (of a thread, filament, or person's hair) thin. noun: very small particles found in mining, milling, etc. adverb: in a satisfactory or pleasing manner; very well. On the first line, it's the word we are defining. The next lines contain the definitions for the word, one per line. Each line with a definition has the following structure (the elements are in sequence): \t as a first character signals that it's a definition the type of the word (noun, verb, adjective, etc.); this is an array of characters that doesn't contain blanks : a separator between the type of the word and the definition the rest of the characters in the line are part of the definition for the word. Two consecutive words in the dictionary will be separated by exactly one blank line. The file can have maximum 1,200 words with their definitions. Each word can have maximum 8 definitions. A word that is defined and the type of the word can have maximum 64 characters, and the text of a definition can have maximum 1024 characters. Use these numbers when you design your code. Dictionary Module - a module named dictionary that contains any structures/functions/global variables that are useful when clients interact with a dictionary. Your code must have at least the following (but you can add more, as your design requires):

///

/// Load from a file a set of words with their definition. Any previous /// existing dictionary is discarded, regardless of the result of the load. ///

/// The name of the file containing the dictionary. /// 0 if data has been loaded from the file, non-zero otherwise /// (null parameter, empty parameter, missing file). int LoadDictionary(const char* filename); ///

/// Save all the words existing in the dictionary into a file. The functions /// "LoadDictionary" should be able to load from this after the save finished. ///

/// The name of the file where to save. void SaveDictionary(const char* filename); ///

/// Search in the dictionary for the word and display all the definitions found. /// /// Print "NOT FOUND: word [X] is not in the dictionary." if /// the word doesn't exist in dictionary. ///

/// The word to search and display. void DisplayWord(const char* word); ///

/// Adds a word to the dictionary. /// /// If the dictionary already contains the word, add a new definition for it. ///

/// The word to add to the dictionary. /// The type of the word (noun, verb, adjective, etc.) /// The definition for the word. void AddWord(const char* word, const char* type, const char* definition); ///

/// Searches in the dictionary for a word and update its definition and type. /// If the word contains multiple definitions, print the message /// "The word [X] has multiple definitions:" followed by a list of existing /// definitions, and asks user which one to update. This function assumes that /// the user's input is correct and doesn't require validation. /// /// If the word is not in the dictionary, this function does nothing. ///

/// The word to update. /// The new type of the definition. /// The new definition. ///