Assessment Details and Submission Guidelines
|
Unit Code
|
MN404 – T3 2018
|
Unit Title
|
Fundamentals of Operating Systems and Java Programming
|
Assessment Type
|
Group of 3 students, written
|
Assessment Title
|
Assignment 2: To write an algorithm/ flowchart, and implement the algorithm using Java programming language for given specifications/ requirements.
|
Purpose of the assessment (with ULO Mapping)
|
This assignment assesses the following Unit Learning Outcomes; students should be able to demonstrate their achievements in them:
c. Apply principles of abstraction and problem solving in an object-oriented programming language
d. Apply knowledge of programming constructs in developing computer programs
e. Create programs based on incremental development processes of designing, coding, testing and debugging.
|
Weight
|
20% of the total assessments
|
Total Marks
|
60 marks
|
Due Date
|
Week 10 laboratory class – To present the algorithm.
Week 11 laboratory class – Demonstration of the assignment.
Submission of final copy of the assignment.
|
Submission Guidelines
|
· All work must be submitted on Moodle by the due date along with a title Page.
· The assignment must be in MS Word format, 1.5 spacing, 11-pt Calibri (Body) font and 2.54 cm margins on all four sides of your page with appropriate section headings.
· Reference sources must be cited in the text of the report, and listed appropriately at the end in a reference list using IEEE referencing style.
|
Extension
|
· If an extension of time to submit work is required, a Special Consideration Application must be submitted directly through AMS. You must submit this application within three working days of the assessment due date. Further information is available at:
http://www.mit.edu.au/about
-
mit/institute
-
publications/policies
-
procedures
-
and
-
guidelines/special
considerationdeferment
|
Academic Misconduct
|
· Academic Misconduct is a serious offence. Depending on the seriousness of the case, penalties can vary from a written warning or zero marks to exclusion from the course or rescinding the degree. Students should make themselves familiar with the full policy and procedure available at:
http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/Plagiarism-Academic-Misconduct-Policy-Procedure
.
For further information, please refer to the Academic Integrity Section in your Unit Description.
|
Academic Integrity:
For assignments, students are encouraged to consult each other, the lecturer, tutor or anyone else for that matter. However, the assistance offered or accepted should not go beyond a discussion of the problem and a sketch of a solution. But in your assignment, do not use any written material from the discussion/website/book. If you can reconstruct the discussion and complete the solution on your own, then you have learned the material (and that is the objective of this course!).
Assignment 2 Specification
Assignment description: Write a detailed algorithm and a Java program to adaptively mark an assessment constituting set of multiple choice questions (MCQ).
Background:
A set of questions have been classified based on the level of difficulty such as simple, moderate and complex. The learner needs to solve the questions of his choice depending on his/her depth of knowledge in that domain. He may select all simple questions, combinations of all three or may be all complex questions. Depending on his choice of questions and the time taken to solve will decide his scored grade or his understanding of the contents.
Algorithm for assessing a student.
Step 1: To begin the Learner has to solve the question associated with root node (central orange node).
Step2a: If he solves it he slides down to right child of the root node in step one (immediate green node on right side).
Step2b: Else he slides down to left child of the root node in step one (immediate white node on left side).
Step 3: Now either right child or left child becomes the root node and step 2a/2b are repeated until all given levels are completed.
The measurement of knowledge gain is based on the path followed and time taken. The learner who follows leftmost path will score minimum grade while the right most path will be awarded with maximum grade. In case the students are not able to solve a question then they shall be moved to left and assisted with the notes or a concerned book. Once he solves that question with assistance he can then continue to solve the next question. Thus this method allows each student to learn in their own pace.
Figure 1: Question tree
In figure 1, the root nodes (orange colour) represent moderate questions in relation to its left and right node. The right nodes(green) denote a complex question and left node(white) a simpler one in relation to the root node. Each node is associated with a MCQ with different complexity. The student will progress in a direction depending on how many questions he/she was able to answer acceptably.
In this assignment students shall develop a frame work to implement the aforementioned adaptive grading system.
Each node shall have a unique id that will be associated with one MCQ in the question bank. The Java program has to grade the student based on the path taken. If the student has taken the right most path (A C G L), then his grade would be HD and if he has followed the leftmost nodes (A B D H)and unable to answer the question linked with left most quest he will get and F grade. In between paths will fetch him either P, C or D.
Figure 2: Adaptive marking tree
The java program shall allow the student to store the questions and answer options in array of strings. Display the first question with answer options. Once the candidate enters the answer options, the program will evaluate the answer and will decide the next question to be attempted. The next question with answer options shall be displayed. This interactive question and answering continues till all questions are attempted, meaning it reaches the last nodes namely H, I, J, K or L.
Once the assessment is completed the program has to compute the grade based on the adaptive marking tree shown in figure 2.
For example:
If a student answers: Question A, C, G, L he will be awarded HD
Question A is answered but not C, and answers F he will score D
Unable to answer A, but answers B and E he will score C
In summary:
The program has to perform the following:
a) Store the questions with answer options using string arrays. (7 marks)
b) Store the corresponding answers of all questions in another array. (2marks)
c) Displaying questions & answer options and provision to enter the answer. (4 marks)
d) Evaluate the entered answer. (4 marks)
e) Repeat steps c and d till the end of the path is reached. (Logic to repeat the sequence) 4 marks.
f) Display the grade scored (4 marks)
Submission Guidelines:
Your assignment should be completed according to the General Guidelines for Presentation of academic work. Your submission should contain the following:
1. The assignment Word file that will be submitted shall include:
o Algorithm/flow chart
o Complete Java program without syntax errors.
o Must include appropriate and sufficient comments in the source code.
o Screen shots of initial compilation results with syntax errors.
o Trouble shooting the syntax errors
o Sufficient screen shots showing all possible outputs obtained.
· The file name must have your
student ID
as part of its name.
2. Documentation should follow the standard submission guidelines as below:
a) Front page - indicating your Group members’ names and student IDs, teaching staff (Lecturer’s and tutor’s name), a statement of what has been completed and acknowledgement of the names of all assisted you.
b) List of references used (IEEE style) – Reference sources must be cited in the text of the report, and listed appropriately at the end in a reference list. Only IEEE referencing style is acceptable for this assignment.
3. The assignment must be submitted using Moodle, one submission for your group. The page numbers of the assignment must be clear on each page. The report document must be checked for similarity through Moodle/Turnitin while submitting it. Please refer to the study skills unit staff if you need further assistance. Please note that only one member per group should submit the report.
4. The group members will have to present the algorithm in Week 10 during the lab hours and demonstrate the program in Week 11. All the group members will have to be present for the demonstration. If any member of the group fails to demonstrate, he/she will lose the demonstration marks.
Marking criteria:
Sections to be included in the report
|
Description of the sections
|
Marks
|
|
|
|
Algorithm
Program
|
All the minute details have to be addressed in the algorithm
Presentation of the algorithm in week 10
Error free, well commented Java program for the algorithm without any discrepancy between the program and the algorithm
|
10
10
25
|
|
Following points must be considered:
Include appropriate import statements
Include a comment at the beginning of your program with basic information and a description of the program
Your code should be properly indented
Give meaningful names to variables and classes in your code.
Correct use of programming structures
Your program compiles successfully without any errors
Your program is interactive and gives correct output.
Your program should follow all the rules mentioned above.
Sufficient test cases considering all the requirements have to be provided with valid and invalid inputs.
|
|
Demonstration and Viva
|
Tutor will see the outputs and also assess your understanding of work done for this assignment in the laboratory class. This will be done during Week-11 laboratory class.
Please Note
:
In case the student remains absent during week 10 and 11 for presentation, demonstration and viva without prior permission for special consideration through AMS , he /she may lose Demo and Viva marks.
|
15
|
|
Total
|
60
|
TASKS/ Grades
|
Excellent
|
Very Good
|
Good
|
Satisfactory
|
Unsatisfactory
|
Algorithm and Program
/35
|
Optimal Algorithm devised (logic used) taking into considerations all possible end conditions as defined.
Flawless Code implemented for the devised algorithm without and gap between the algorithm and the program.
|
Relevant Algorithm devised (logic used) taking into considerations all possible end conditions.
Flawless Code implemented
|
Generally relevant Algorithm devised (logic used) taking into considerations most of the end conditions.
Flawless Code implemented.
|
Some relevance in the algorithm and few conditions are considered.
|
The logic used is not relevant.
|
Demonstration and Viva
/15
|
Demonstrate very well with excellent Logic, clarity and easy to follow with strong arguments and sound technical knowledge. Excellent ability to critically analyse the queries and alter the code accordingly.
|
Demonstrate well with sound Logic and clarity. Has ability to critically analyse the queries with good technical knowledge.
Troubleshoots easily.
|
Demonstrate with good Logic. Has ability to analyse the queries technically.
Attempts to troubleshoot.
|
Demonstrates the work with less technical knowledge.
Poor in troubleshooting.
|
Argument is confused and disjointed
|
Algorithm Presentation
/10
|
Excellent presentation with clarity, made appropriate eye contact with audience and engaged them. confidently answered all the questions.
|
Sound
presentation with clarity, made eye contact with audience and engaged them fairly.
Answered most of the questions.
|
Good presentation with relative clarity, made eye contact with audience and engaged audience some times.
Answered some of the questions
|
Fair presentation with less clarity, Poor audience engagement.
Had difficulty answering the questions.
|
Spoke unclearly, seldom made eye contact with audience. Could not answer the questions.
|