Assignment 1 Front Sheet: Qualification BTEC Level 5 HND Diploma in Computing Unit Number and Title Submission Date

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 Do Thi Dieu Linh Student ID BHAF190198
Class RT7 Assessor name Nguyen Thai Cuong
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.
Linh
Student’s signature
Grading grid
P1 M1 D1
1
❒ Summative Feedback: ❒ Resubmission Feedback:
Grade: Assessor Signature: Date:

Lecturer Signature:
Table of Contents
I. Introduce................................................................................................................................................................................................................................ 5
II. Algorithm........................................................................................................................................................................................................................ 5
IV. Seven steps of building an application.......................................................................................................................................................................... 8
V. Solve problems using algorithms.......................................................................................................................................................................................... 9
VI. Conclusion.................................................................................................................................................................................................................... 15
VII. References..................................................................................................................................................................................................................... 15
I. Introduce
As we all know, all efforts and “intelligence” of the researcher are clearly shown in the report. The report aims to help students consolidate industry
knowledge through research, outreach and industry insights. The report will discuss the definition, characteristics of algorithm, and how to
different paradigms programming. Last but not least, the report will help you develop kills as communication literacy, critical thinking and
interpretation which are crucial for gaining employment and developing academic competence.
II. Algorithm
1. Definition of algorithm
Definition of algorithm
Algorithm is one of the foundations of programming. There are many definitions of algorithm, but we can understand, an algorithm is a step-by-
step description of the solution to a problem. For example, you want to complete the task from Hanoi to Saigon. You will need “algorithm” to buy
tickets -> catch grab to the airport -> fly to Saigon. In another case, for example, if you want to search for the name “Lin” in your school transcript,
you will find the letter L ->find the letter Li -> and so on. Those are but few examples of where we can apply algorithm in everyday life as well as
in jobs. In computer science, finding a good algorithm is very important for the program.
Algorithm help to describe the solution a problem or task; by in identifying the data and the process needed to represent the problem and the steps
needs to produce the desired result. In addition, the algorithm has input and output. In short, an algorithm must solve the job when we put in the
data.
Not all procedure can be called an algorithm. The algorithm has five important characteristics of algorithms.
Characteristics and example of algorithm
Algorithms are well-ordered: The algorithm should be clear and unambiguous. The specific order of each step in an algorithm must be clear. Each
step should be clear and only a definite purpose.
Algorithms have efficient computational operations: Each operation in an algorithm must be doable.
Algorithms have unambiguous operation: Each operation in an algorithm must be clear for the computer to understand. The algorithm must be
clearly expressed by transparent statement; the statements are arranged in a defined order.
Algorithm produces a result: An algorithm is written by many people on different computers must produce the same result.
Algorithm pauses for a finite amount of time: Algorithms should include a finite number of operations and must complete the operation in a
finite amount of time.
For example: let’s write algorithm to solve the equation a x + b = 0
Algorithm:
Step 1: Enter two real numbers a and
b. Step 2: if a=0
- If b=0, we print information that the equation is an identity equation.
- If b#0, we print information that the equation is a contradictory
equation. Step 3: x <- -b/a
Step 4: Given solution x, then finish.
Code:
Pc1: code of the program
III. Seven steps of building an application
There are seven steps of programming as follows:
Step 1:
Design the Programming Objectives: When planning a program, the first thing we need to do is to understand the needs of our customers and
determine what is required of the application. Then we can identify the necessary input and the desired output.
Step 2:
Design the Program: After building a general picture of what the program should do, the next is to find out how to operate it. In other words,
this is the algorithm building steps. Another, the algorithm should have all the characteristics of any algorithm. Things to consider when
designing the program include choosing a user interface and choosing a way to represent the data.
Step 3:
Write the cope: Next, a design for the program is ready, the programmer starts writing the cope. We must write programs that can write
codes in other programming language like C, C++, C#, Python, java or whatever else. The documentation can be included the code, or
written in a separate file.
Step 4:
Compile: The next step is to translate from the source code language which human can understand into the machine language for the
computer to understand. This is the job of the compiler. The computer also looks foe errors inside the code. After verifying that the code
is error free, the compiler translates it into executable code ready to run.
Step 5:
Compiling and running the Program: Compiling is a matter of translating a source file from human readable to machine readable format.
Generally, source files are compiled on a unit-by-unit basis. Running is getting some binary executable (or a script, for interpreted
language) to be, well…executed as a new process on the computer. Programmers can compile and run the program inside the IDE.
Step 6:
Test and Debug the Program: The source code being complied and executed doesn’t mean the program is ready to use. The purpose of testing
is to find bugs and errors. Testing is done during every phase of program development. There are many mistakes that the programmer can
make such as applying the wrong algorithm, or ignoring certain data requirements. The purpose of debugging is to correct those bugs
found during testing. Another way is to use support from IDE.
Step 7:
Maintenance: Overtime, the programming can add new features to adapt the user’s new demands. Program maintenance to keep pace
with changing requirements and technologies. This step can be done easily it the programmer follows a good design and provide proper
documentation.
IV. Solve problems using algorithms

Problem
In order to promote library management so that schools can build modernization, while ensuring traditional services as well as
characteristics of library management. There, Library Management Software was born. Library management system is to reduce and
solve the cumbersome manual management, so that the library can rise to a perfect electronic management. This is a useful information
and information system to meet the research and learning needs of students and lecturers in the school.
Analysis
- Identify key features like book management, reader management, loan slip management.
- Book management: Allows users to add, delete, edit and search book information.
- Reader management: Allow users to add, delete, edit and search for information about reader.
- Managing loan slip: Allows users to enters information about and returning books of readers.
Menu of the program
The following is an illustration of menu of program that I will build for the problem:
11
II. Functional
analysis Flowchart
- Main menu
Pc2: Main menu
12
- Diagram of adding books:
PC3: Add book

- Search
Pc4: Search book
V. Conclusion
To sum up, the report has provided the definition and characteristics of algorithm, as well as the step of building an application. Another, an
example of algorithm quality is also demonstrated. The report also discusses a number of programming paradigms and their man
characteristics. Finally, an analysis of Integrated Developments is provided, it will be used to develop and help track any issues with the
code.
VI. References
There are no sources in the current document

Assignment 1 Front Sheet: Qualification BTEC Level 5 HND Diploma in Computing Unit Number and Title Submission Date

Uploaded by

Copyright:

Available Formats

Assignment 1 Front Sheet: Qualification BTEC Level 5 HND Diploma in Computing Unit Number and Title Submission Date

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Assignment 1 Front Sheet: Qualification BTEC Level 5 HND Diploma in Computing Unit Number and Title Submission Date

Uploaded by

Copyright:

Available Formats

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 Do Thi Dieu Linh Student ID BHAF190198

Class RT7 Assessor name Nguyen Thai Cuong

Grade: Assessor Signature: Date:

IV. Solve problems using algorithms

Pc2: Main menu

PC3: Add book

You might also like