INNOVATION UNIVERSITY OF AUSTRALIA WANTS TO ALLOW A LECTURER

  100% Pass and No Plagiarism Guaranteed

INNOVATION UNIVERSITY OF AUSTRALIA WANTS TO ALLOW A LECTURER

Task

The Innovation University of Australia (IUA) wants to allow a lecturer to enter the marks of a number of students (instead of just a single student) and store the information permanently in a text file on their computer. They also want to allow a lecturer to search details of a student in the text file by the student ID.

The main program should first display a menu as follows. A lecturer needs to select an operation from the main menu.

================================================
Welcome to the AGoS System of IUA

Please select an option from the following.
dd details of a student.
earch student details for a student.
uit.

================================================

If a lecturer chooses the option the program then asks them to enter a student’s ID, name, and the Assignment 1, Assignment 2 and Final Exam mark one by one. Once all marks for a student are entered it will display the student ID, name, weighted mark for each assignment, the total weighted mark of the assignments, weighted mark for the Final Exam, total weighted mark of the subject, bonus mark and total mark with bonus.

The system will then ask the lecturer `Do you want to enter marks for another student (Y/N)?` If they enter `Y` the system will allow them to enter details and marks for another student as before, if they enter `N` the system will display the main menu again, otherwise it will ask the same question again.

A typical example of the display of the program (once a lecturer chooses the option ) can be as follows. Your program MUST follow the same display style.

-----------------------------------------------------------------------------------------
The Innovation University of Australia (IUA) Grade System
-----------------------------------------------------------------------------------------
Please enter all marks out of 100.

Please enter the student ID: 1111
Please enter the student name: Alice Furner
Please enter the marks for Assignment 1: 80
Please enter the marks for Assignment 2: 90
Please enter the marks for the Final Exam: 74

Thank You!

Weighted mark for Assignment 1: 16
Weighted mark for Assignment 2: 27
Total weighted mark of the assignments: 43

Weighted mark for the Final Exam is: 37
Total weighted mark for the subject: 80

Bonus mark: 3.5
Total mark with bonus: 83.5

Do you want to enter marks for another student (Y/N)? z
Do you want to enter marks for another student (Y/N)? Y

Please enter the student ID: 1112
Please enter the student name: Bob Siers
Please enter the marks for Assignment 1: 68
Please enter the marks for Assignment 2: 68
Please enter the marks for the Final Exam: 92

Thank You!

Weighted mark for Assignment 1: 13.6
Weighted mark for Assignment 2: 20.4
Total weighted mark of the assignments: 34

Weighted mark for the Final Exam: 46
Total weighted mark for the subject: 80

Bonus mark: 3.5
Total mark with bonus: 83.5

Do you want to enter marks for another student (Y/N)? N

================================================
Welcome to the AGoS System of IUA
Please select an option from the followings.
dd details of a student.
earch student details for a student.
uit.
================================================

The system will also store the details and marks of each student in a file called IUA.txt in the same folder as the Python code of the AGoS system. Every time a student`s details are entered the system should append them in the text file.

For example, the IUA.txt file will have the following content after the details of Alice Furner are entered.

However, the file content will be as follows after the details of Bob Siers are entered.

If a lecturer chooses the option from the main menu then the program asks the lecturer to enter the student number for whom they want to see details. To facilitate the search option you need to use an appropriate data structure such as List. The program then collects the student details from the IUA.txt file and displays it as follows (assuming the following student was searched for).

After displaying the student information the program prompts the lecturer with the following message, `Do you want to search for another student (Y/N)?` If a lecturer enters `Y` then the program asks them to enter the student number for whom the information needs to be searched and displayed, else if the lecturer enters `N` then the program displays the main menu, otherwise the program prompts the same message again.

Finally, the program quits if the user chooses the option < Q>.

You need to develop the system by completing the following three tasks::

Task 1 -

Draw NassiShneiderman (NS) diagram/s that present the steps of the algorithm required to perform the task specified.

Task 2 -

Select three sets of test data that will demonstrate the `normal` operation of your program; that is, test data that will demonstrate what happens when a VALID input is entered. Select two sets of test data that will demonstrate the `abnormal` operation of your program.

Set it out in a tabular form as follows: test data type, test data, the reason it was selected, the output expected due to using the test data, and finally the output actually observed when the test data is used. It is important that the output listings (i.e., screenshots) are not edited in any way.

Task 3 -

Implement your algorithm in Python. Comment on your code as necessary to explain it clearly.

In addition for this exercise, use multiple functions, instead of using a single function to do everything. Create a good design of the functions to make the best use of the code and avoid duplicate calculations. For example, you can have a function for calculating the weighted mark of an assignment and the function can be used for calculating all weighted marks. Avoid duplicate code.

You also need to design your program so that it has components that can be reused in another program, if needed. Handle exceptions appropriately. Use appropriate data structure.

Run your program using the test data you have selected and complete the test data table above.

Your submission will consist of:

1. Your algorithm through NassiShneiderman (NS) diagram/s.
2. The table recording your chosen test data and results (it can be in a Word file)
3. Source code for your Python implementation

Rationale

This assessment task is designed to reinforce topic material related to simple functions, files, exceptions and lists.

The task meets the following learning objectives:

LO 1. be able to explain the steps involved in a disciplined approach to problem-solving, algorithm development and coding

LO 2. be able to demonstrate and explain elements of good programming style

LO 3. be able to identify, isolate and correct errors in all phases of the programming process

LO4. be able to interpret algorithms and program code

LO6. be able to apply sound program analysis, design, coding, debugging, testing and documentation techniques to simple programming problems

LO.7 be able to write code in an appropriate coding language