Month: May 2018

Learning Objective: to write Python code responding to a given case study and requirements specification.

Theory & Programming

This week is our second (and final) SAC for Unit 3. In our double period, you will be required to write code to solve a given problem.

You must be prepared to do any and all of the below:

• Write code to open a plain text file (CSV)
• Write code to read the CSV file, react to its contents, and write back to a new CSV or XML file.
• Write code to open and read an XML file.
• Write code to modify that XML file, and save it back to a new XML or CSV file.

No user interface programming is required for this SAC task. The SAC is worth 17 marks.

Learning Objective: to know the different file formats that exist for data input and storage.

Theory:

We’ll be looking at how programming languages handle input and output both within program logic as well as within storing data to files. This theory covers the characteristics of data as well as how to handle and manage files. Specifically we’ll be comparing CSV files to XML files.

You will also receive a practice SAC this week for our SAC next Wednesday.

Programming:

1. Modify the Python code demonstrated in class to add three more books to the library.xml file.
2. Modify the Python code demonstrated in class to handle displaying different editions of books from the library.xml file.

The XML file is “library.xml” and can be downloaded from Compass Resources.

Homework:
Programming: Complete the task above. Due: Tue, 29th May, 2018.

Learning Objective: to understand aspects of efficiency in computational algorithms.

Theory:

This week we’ll be covering linear and binary searching and efficiency of algorithms.

Most of your class time this week will be dedicated to your SAT.

Programming:

Optional: Change your program from last week to use binary search instead of linear search.

Homework:
Theory: Continue working on your SAT.
Programming: Optional: Complete the task for the week.

Learning Objective: to be able to determine the non-functional requirements of your folio project.

SAT: Reminder: there is a SAT checkpoint this week. Work in progress on your SRS will be checked on Wednesday.

Theory:

No new theory, just a discussion of non-functional requirements as part of your SRS. I will be absent for Monday’s class.

Programming:

Create a user interface for a search box.

• There should be a text entry box for putting in a key word, and a button to initiate the search.
• Use the word list given to you for the hangman game earlier this year.
• When pressing “search”, check all of the words in the world list to see if the word is there.
• For each word checked, increment a counter “x” to keep track of how many words you had to look at before you found (or didn’t find) the word.
• If the word is present, display “word found after checking x words” in a label in the user interface.
• If the word isn’t present, display “word not found in x words checked” in a label in the user interface, where x is the total number of words searched.

Homework:
Theory: No theory homework this week. Work on your SRS.
Programming: Finish the programming task for the week. Due: 16th May, 2018