Download Algorithms for Business: Student Management and Hiring and more Assignments C programming 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 15/06/2021 Date Received 1st submission 15/06/
Re-submission Date Date Received 2nd submission
Student Name Nguyễn Đăng Thành Student ID GCS
Class GCS0904_NX Assessor name Thái Thị Thanh Thảo
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 x
❒ Summative Feedback: ❒ Resubmission Feedback:
Grade: Assessor Signature: Date:
Lecturer Signature:
I. Introduction:
This report is written about the fact that you have applied as an intern for a software development company and have been invited for an interview. You have been asked to demonstrate your basic programming and problem solving skills. To do this, you must prepare a report on the use of algorithms to solve the problem.
II. Body:
Chapter 1. State your simple business problems to be solve
1.1. Overview about Algorithm:
The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving
operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to
be executed upon in order to get the expected results. It can be understood by taking an example of cooking a
new recipe. To cook a new recipe, one reads the instructions and steps and execute them one by one, in the
given sequence. The result thus obtained is the new dish cooked perfectly. Similarly, algorithms help to do a
task in programming to get the expected output. The Algorithm designed are language-independent, i.e. they
are just plain instructions that can be implemented in any language, and yet the output will be the same, as
expected.[1]
Figure 1: Algorithms [2]
Bubble Sort is probably the most popular sorting algorithm. Most programmers start with this sorting algorithm even though its performance is not good enough for most practical cases. But it is much simpler than other efficient sorting algorithms like quick sort or merge sort.Bubble sort algorithm is to continuously swap two adjacent elements if they are not in right order until no swapping is required.In programming, generally two nested loops are used. Inner loop starts from the first element and checks whether that is in right order with the next element. If not, then it swaps them. Then the control moves to the next position and repeats the same thing.At the end of every outer loop iteration, one element is placed at the right position. [4]
Figure 2: The example of Bubble Sort [3]
Use - case first problem:
Figure 3: Use case of student management system
Flowchart second problem:
Figure 2: Flowchart of rising process
