Exercise 1
The attributes of alecturer are name, payroll number, department and salary.
Write a function which takes a string argument, and creates and returns a tuple containing details of the lecturer specified by the string. The string should be assumed to have the format
12345 CSEE25000 Bartholomew Homer Simpson
The first three items in the line will be the payroll number, department and salary; the rest of the line will be the name, the last word of which is the surname. There will be no spaces in the department but there will be spaces in the name. The tuple should contain exactly 5 items: the payroll number, salary, job title, surname and other names. (The other names should be stored as a single string; the surname will be the last name in the input line so in the example above the surname is Simpson and the other names areBartholomew Homer.)
Next, write a function that will print the details of a lecturer on a single output line. It should take a tuple as its argument and print the details in fixed-width fields using a layout such as
Simpson, Bartholomew Homer 12345 CSEE £25000
The name should be displayed using the format shown above so you will need to create a string containing the name in this format and print it in a fixed-width field. You may assume that no name will contain more than 30 characters when displayed in this format, no department will contain more than 15 characters, payroll numbers will contain at most 5 digits and all salaries will be integers less than 100,000.
In the main body of the program, write code which prompts the user for a filename and attempts to open the file whose name is supplied.If the file cannot be opened an error message should be output and the program should terminate; otherwise the program should read each line from the file and supply it to the lecturer-creation function, storing the tuples returned by this function in a list.
After the data has been input the program shoulddisplay details of all employees in the list in a neat table (using the function already written) then enter a loop in which the user should be given the option of requesting the display of full details of all of the employees from a particular department or the names (with no other details) of all lecturers with a salary in a particular range (e.g. 20000 to 30000), or quitting the program. The user should then be asked to supply the department or upper and lower bounds of the salary range (as appropriate), the list should then be searched and the appropriate output displayed (using the function written earlier when full details are required). The list of names for the salary-range output should be sorted alphabetically by last name (also using the first name if the last names of two employees are the same), but displayed using the format Bartholomew Homer Simpson.
Appropriate messages should be displayed if a search produces no results.
Exercise 2
This assignment involves writing a program to solve word search puzzles. For example in the following word grid it is possible to find the words active, stock, ethernet and java. the following word grid it is possible to find the words active, stock, ethernet and java. Note that this exercise involves only horizontal and vertical words; words that occur diagonally (such as python) are not considered as being present in the grid.
xmmycxvtljlqbbybkoumjqwbtbufve
buubmekxbeydqmcnzyjpvdankomdmi
lqactivexnyvwdvcoshoyrohgvfvqj
vsewohvnbxsduqjiffkoyhpdwbrngc
dvqwwwfkoyamapmlrrjvtkljpcvkua
iqqfxtumsjvfmtrsbycyqiarixqikp
afgrvlqzdqaxaoanfqplmjpjhnzams
yofywrbpfcjiflcbbcoecxpwljyuyt
twyxetyuyufvvmcuawjmbwlqhxjgqo
txekdexmdbtgvhpyvsqtmljdxeqltc
dcctenrehteoxqdgnueljtrrnesgok
oqsnakqwerouftmgnjqbytjzhmwncc
2.1 Inputting the Grid from a File
write code to prompt the user for a filename, and attempt to open the file whose name is supplied. If the file cannot be opened the user should be asked to supply another filename; this should continue until a file has been successfully opened.
The file will contain on each line a row from the grid. For example the first two lines of a file that contains the grid shown on the previous page would be
xmmycxvtljlqbbybkoumjqwbtbufve
buubmekxbeydqmcnzyjpvdackomdmi
Write code to read, in turn, each line of the file, remove the newline character and append the resulting string to a list of strigs.
After the input is complete the grid should be displayed on the screen.
Note that grids used for testing the submitted programs may have different widths and heights from the sample one that will be provided. Grids will contain only lower-case letters.
2.2 The Word-Search Function
Write a function that will take two arguments: a word to be searched for and a list of strings containing the grid.
The function should searchfor a horizontal (left-to-right or right-to-left) or vertical (downwards or upwards) occurrence of the word (e.g. activex and ethernet in the sample grid). If a word occurs more than once the function is required to find only one occurrence so you should stop searching once the word has been found.
[ It is recommended that you first write a function that just searches for horizontal occurrences and then write the code for section 2.3 to allow the function to be tested before adding code to the function to search for vertical occurrences. ]
If the word has not been found None should be returned; if the word has been found the function should return a tuple, containing the row and column numbers of the first and last letters of the word (i.e. four integers). The top row should be regarded as row 1 and the leftmost column as column 0
2.3 The Word-Search
After displaying the grid, the program should ask the user to supply a name of a file containing words to be searched for, one word per line. This file should be opened, once again asking the user to supply another name if necessary. You should supply each word in this file in turn to the word-search function. If the function returns None the word should be added to a list of words that have not been found; otherwise the tuple returned should be added to a dictionary using the word as a key.
After searching for all of the words you should display details of all words in the dictionary (in alphabetical order) using a format such as
active found: row 3 col 3 to row 3 col 8
Finally you should output a list of the words that were not found (also in alphabetical order).