Download Assignment 2 programing 1618 and more Study Guides, Projects, Research Programming Languages in PDF only on Docsity!
ASSIGNMENT 1 FRONT SHEET
Qualification BTEC Level 5 HND Diploma in Computing
Unit number and title Unit 1 : Programming
Submission date Date Received 1st submission
Re-submission Date Date Received 2nd submission
Student Name Nguyễn Minh Đức Student ID GCH
Class GCH1006 Assessor name
Student declaration
I certify that the assignment submission is entirely my own work and I fully understand the consequences of plagiarism. I understand that
making a false declaration is a form of malpractice.
Student’s signature
Grading grid
P1 M1 D
ASSIGNMENT BRIEF 1 (RQF)
Higher National Certificate/Diploma in Computing
Student Name/ID Number:
Unit Number and Title: Unit 1: Programming
Academic Year: 2021 – 2022
Unit Assessor: Vinh Hoang
Assignment Title: Problem solving with algorithms
Issue Date: 01 April 2021
Submission Date:
Internal Verifier Name:
Date:
Submission Format:
Format:
● The submission is in the form of an individual written report. This should be written in a concise,
formal business style using single spacing and font size 12. You are required to make use of
headings, paragraphs and subsections as appropriate, and all work must be supported with research
and referenced using the Harvard referencing system. Please also provide a bibliography using the
Harvard referencing system.
Submission
● Students are compulsory to submit the assignment in due date and in a way requested by the
Tutor.
● The form of submission will be a soft copy posted on http://cms.greenwich.edu.vn/.
● Remember to convert the word file into PDF file before the submission on CMS.
Note:
● The individual Assignment must be your own work, and not copied by or from another student.
● If you use ideas, quotes or data (such as diagrams) from books, journals or other sources, you
must reference your sources, using the Harvard style.
● Make sure that you understand and follow the guidelines to avoid plagiarism. Failure to comply
this requirement will result in a failed assignment.
Unit Learning Outcomes:
LO1 Define basic algorithms to carry out an operation and outline the process of programming an
application
Assignment Brief and Guidance:
Assignment scenario
You have applied for a post as a trainee with a software development company and have been invited for
an interview. You have been asked to demonstrate your problem solving and basic programming skills. To
do this you have to prepare a report on using algorithms to solve problems.
You need to explain, using examples, how algorithms are used to solve simple business problems and the
steps needed to be followed to produce a working program solution. You should make clear your
assumption about your program. The problems to be solved will involve basic procedural programming
instructions - sequence instructions (input, output and assignment statements), loops, conditional
statements. Problems should be analysed and designed by the use of flowchart and demonstrated by the
use of modules (procedures).
Tasks:
- State your simple business problems to be solved.
- Analyse the problem and design the solutions by the use of suitable methods.
- Demonstrate the compilation and running of a program
- Evaluate how the problem is solved from the designed algorithm to the execution program
written by a specific programming language.
Table of figure
Figure 1: The brew tea algorithm....................................................................................................................... 5 Figure 2: Algorithm is clear from input to output................................................................................................ 5 Figure 3: Swap number algorithms include 8 steps .............................................................................................. 6 Figure 4: Using available resources to handle problem ........................................................................................ 6 Figure 5: Algorithm can implement in many languages ........................................................................................ 7 Figure 6: Sorting grade of student problem......................................................................................................... 7 Figure 7: How bubble sort algorithm works......................................................................................................... 8 Figure 8: Source code ....................................................................................................................................... 13 Figure 9: Screenshot of the final result (1) ......................................................................................................... 15 Figure 10: Screenshot of the final result (2)........................................................................................................ 15 Figure 11: Software Development Life Circle...................................................................................................... 16 Figure 12: Example about how C# compiler works.............................................................................................. 17
ASSIGNMENT 1 ANSWER
1. State your simple business problems to be solved
1.1. Overview about algorithm
Definition: An algorithm is a procedure or formula used for solving a problem. It contains the steps, which is a set of actions that are executed in a certain order to obtain the desired output. For example: The brew tea algorithm Characteristics of algorithm:
- Unambiguous: The algorithm should be explicit and straightforward. Each of its processes as well as their inputs and outputs, should be obvious and lead to just one conclusion. Figure 1 : The brew tea algorithm Figure 2 : Algorithm is clear from input to output
- Finiteness: Algorithm must handle the problem after doing number of certain steps.
- Feasibility: program can solve problem with given the resources Figure 3 : Swap number algorithms include 8 steps Figure 4 : Using available resources to handle problem
To handle this problem, I will use bubble sort algorithm because it is simpler than other sorting algorithms. Idea of this algorithm is sorting a list of grades of student by repeating the task of swapping two consecutive grade if they are in the wrong order (the latter grade is less than the previous grade) until the sequence grades has been completely sorted by ascending order.
2. Analyze the problem and design the solutions by the use of suitable methods. 2.1. Analyze the problem Input: ➢ - Total of student. ➢ - A list of students included student name and their grade. Output: A list of students is sorted by grade in ascending order. Variables are used: Variable Data type Purpose total integer Store total of student name string array Store student name grade double array Store student grade i, j integer Access each of student name or grade tempName string Store temporary name in order to support swapping value tempGrade double Store temporary grade in order to support swapping value Figure 7 : How bubble sort algorithm works
Structures are used: Structure Purpose If Compare student information to sort For Access each student information
Explain by pseudo code: Step 1: START Step 2: DECLARE tempName, tempGrade, i, j; Step 3: SET i=0; Step 4: WHILE i<total-1 is True, REPEAT step 5 through step 9. Step 5: SET j=i+1; Step 6: WHILE j<total is true, REPEAT step 7 through step 8. Step 7: IF grade[i]> grade[j]: Step 7.1: SET tempName= name[i], SET tempGrade=grade[i]. Step 7.2: SET name[i]=name[j], grade[i]=grade[j]. Step 7.3: SET name[j]=tempName, grade[j]=teampGrade. Step 8: INCREASE j by 1. Step 9: INCREASE I by 1. Step 10: STOP.
- Demonstrate the compilation and running of a program 3.1. Introduce how the problem is solved In my program, I apply procedural programing to divide this problem into small tasks that includes function readList, printList and sortList. In addition, I have used algorithm that was designed in task 2 to build function sortList. The function readList and printList will support function sortList in reading and displaying result. In detail, my program will read unsorted list of students that included name and grade from keyboard, and then I display this list on console screen. After that, I sort this list by grade and display it on console screen.
3.2. Source code and screenshot of the result final
I use the algorithm that I have analyzed and designed in task 2 to build function sortList: ➢ I declare 2 variable: tempName and tempGrade in order to store temporary name and grade that will support swapping 2 values (name, grade). ➢ I use 2 for-structures combine if-structure with condition (grade[i]>grade[j]) to check if latter grade less than previous grade. In case this condition is true, I will swap variable name[i] and name[j], grade[i] and grade[j]. ➢ The final step: In method Main, I use 3 above functions to handle problem follow order: Read list of students that has not been sorted→display list before sorting→so rtin g list→disp lay list after sorting.
Screenshots of the final results: Figure 9 : Screenshot of the final result (1) Figure 10 : Screenshot of the final result (2)
4. Evaluate how the problem is solved from the designed algorithm to the execution program written by a specific programming language 4.1. Test case: Test case ID Test objective Data Expected result Actual result Evaluation T01 List of The list includes 3 students The list of students The list of Pass students and their information are was sorted by grade in students was after sorting Nguyen Van Long 5 ascending sorted by by grade Bui Thi Linh 3 Bui Thi Linh 3 grade in Dang Van Cuong 9.5 Nguyen Van Long 5 ascending Dang Van Cuong 9. The list includes 5 students The list of students The list of Pass and their information are was sorted by grade in students was Bui Duc Canh 8.1 ascending sorted by Bui Xuan Truong 9.0 Do Duc Thang 4.1 grade in Ha Thi Linh 7.6 Vu Thi Hue 6.6 ascending Do Duc Thang 4.1 Ha Thi Linh 7. Vu Thi Hue 6.6 Bui Duc Canh 8. Bui Xuan Truong 9. Figure 12 : Example about how C# compiler works
The list includes 10 The list of students The list of Pass students and their was sorted by grade in students was information are ascending sorted by Nguyen Trong Hue 8.0 Tang Tien Dat 1.5 grade in Tang Tien Dat 1.5 Nguyen Minh Duc 4.9 ascending Bui Quang Dung 9.6 Ngo Minh Quang 5. Ngo Minh Quang 5.2 Nguyen Thi Thao 6. Cao Viet Anh 7.7 Nong Van Lam 6. Nguyen Minh Duc 4.9 Cao Viet Anh 7. Nguyen Thi Thao 6.1 Nguyen Trong Hue 8. Ha Thu Trang 8.8 Ha Thu Trang 8. Nong Van Lam 6.7 Bui Quang Dung 9. Truong Hai Dang 10.0 Truong Hai Dang 10. 4 .2. Evaluate how the problem is solved from the designed algorithm to the execution program written by a specific programming language Algorithm is ordered steps to solve a certain problem. When we analyze and design the algorithm, we can understand the nature of the problem and the appropriate solution. On the other hand, the computer cannot understand human language, so we have to write it in a suitable programming language that compilers can compile for the computer to understand and run. The program written will be based on the designed algorithm to complete work. Therefore, written algorithm and code variant are closely related in solving problems
5. CONCLUSION Nowadays C# is one of the most popular language in the world, end it coming more and more common. This report gives me a chance to practice with it. In this report, I introduced about C# language, algorithm, SDLC. I made a program for student management using procedural programming. The essential necessities that the problem needs were all successfully delivered and implemented.
