Group Assignment on Algorithm Design and Implementation

Assessment Task

The assignment is a group assignment.

Requirements:

You are required to submit all parts of your assignment.

You all should submit individually on Moodle.

Create a word file and write a paragraph for your contribution to the assignment and reflection of learning.

Submission: Create a folder, give it name as “yourName_ModuleCode”. Place all the files in one folder, compress it and upload on Moodle.

The following table illustrates the allocation for each individual part of the assignment.

Problem 1

Design an algorithm that will read a series of integers at the terminal. The first integer is special, as it indicates how many more integers will follow. The first integer must be between 3 and 10. Your algorithm is to calculate the sum and average of the integers, excluding the first integer, and display these values to the screen. The program must also display the minimum and the maximum number entered excluding the first integer.
Write algorithm in the form of Pseudocode and flowchart. Perform desk checking (include desk check table). Implement it in C#. Do not use ANY function for sum, average, minimum and maximum.

Problem 2

A parts inventory record contains the following fields:
• record code, (only code 11 is valid)
• Part number (six characters)
• Part description
• Inventory balance.

Design an algorithm that will read the file of parts inventory records, validate the record code and part number on each record, and print the details of all valid inventory records that have an inventory balance equal to zero. Your file must have at least two records.
Write algorithm in the form of Pseudocode and flowchart. Perform desk checking (include desk check table). Implement it in C#.

General Requirements for Students:

1.A proportion of assessment marks is allocated to presentation (if required). All assignments must be word-processed, with word count noted unless otherwise stated by the lecturer.

2.Where a hardcopy submission is required, an Assignment Submission Form must be securely attached to each submission.

3.All assignments must be submitted no later than the stated deadline.

Assignments   submitted   after   the   deadline   published   in   the   assessment   specification, including any extension, are deemed to be ‘late’ and are penalized, as follows:

Where an assignment is submitted between 1  and  14  days  late  2  marks  a  day  are deducted.

Where an assessment is more than 14 days late it is annotated at the discretion of the lecturer but no marks can be awarded.

Where the assessment  is  undertaken  in  a  group,  the  piece  of  work  should  be submitted  in  its complete  entirety,  and  any  penalty  for  late  submission  incurred applies to all group members.

4.All relevant provisions of the Assessment Regulations must be complied with.
   
5.Extensions to assignment submission deadlines will be not be granted, other than in exceptional circumstances.  Once completed this form should then be returned to your Programme Leader, for approval.
 
6.Students are required to retain a copy of each assignment submitted, and the submission receipt (If a physical submission is required) until the issuing of a transcript indicating the mark awarded.

7.Assignments must be appropriately packaged and presented.

8.Where a submission involves digital media, it is the submitting students’ responsibility to ensure the media is appropriately labelled, fully working and they must retain a copy.

9.Assignments that breach the word count requirements will be penalised.  There is a 10% discretion, either way, applicable in terms of word count.

10.Students are required to refer to the assessment regulations in their Student Guides and on the Student Website.

11.Dublin Business School penalises students who engage in academic impropriety (i.e. plagiarism, collusion and/or copying).

12.To prevent plagiarism please follow this link to the Harvard/OSCALA (delete as appropriate) Style Referencing Guide - all referencing is required in this format.  a