











Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A simple program for managing student grades. It includes an overview of algorithms, a representation of a small problem related to sorting student grades, an analysis of the problem, and the design of a solution using suitable methods. The document also demonstrates the compilation and running of the program, including the source code, screen shots of the final result, and a brief explanation of the software development life cycle (sdlc) and how the source code is compiled. The program allows users to input student information, display the list of students, search for a student by name, sort the grades in ascending or descending order, and sort the names in alphabetical order. This document could be useful for students studying programming, data structures, and algorithms, as well as for educators looking to implement a simple grade management system.
Typology: Assignments
1 / 19
This page cannot be seen from the preview
Don't miss anything!












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 Đặng Nam Hưng Student ID GCH Class GCH1104 Assessor name Đặng Trần Long 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 Hưng Grading grid P1 M1 D
Grade: Assessor Signature: Date: Lecturer Signature:
**1 – State your simple business problems to be solved (P1) 1.1 Overview about algorithm
To solve this problem, I use the bubble sort algorithm due to it is the simplest. This algorithm will swap two consecutive grade if the next grade is greater than the current until the sequence grades has been sorted in order and sort the name in order. 2 – Analyse the problem and design the solutions by the use of suitable methods (P1) 2.1 Analyse the problem
*** Input function:**
*** Search function:**
3 – Demonstrate the compilation and running of a program (P1 – M1) 3.1 Introduce how the problem is solved To solve this problem, I apply procedural programing to divide it into small tasks so that I can easily solve the problem. In the input information stage, I use if-else conditional statement and for and do-while loops to consider if the ID is duplicate or not and to see if the grade is in a range from 0 to 10. **3.2 Source code and screen shots of the final result
4. Reference Alexander S. Gillis, 2022. Algorithm. [online] Available at: https://www.techtarget.com/whatis/definition/algorithm [Accessed 10 August 2022] Admin, 2022. Software Development Life Cycle (SDLC). [online] Available at: https://www.tutorialspoint.com/sdlc/sdlc_overview.htm [Accessed 10 August 2022]