ASM1 Programing
ASM1 Programing
Academic Year
Unit Tutor
Submission Format:
Format: The submission is in the form of an individual written report and a presentation. 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 on the due date and in a way requested
by the Tutors. The form of submission will be a soft copy in PDF posted on the corresponding
course of http://cms.greenwich.edu.vn/
Note: The Assignment must be your work, and not copied by or from another student or
Books, etc. 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 know how to reference properly,
and that understand the guidelines on plagiarism. If you do not, you get to fail
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, and conditional
statements. Problems should be analyzed and designed by the use of flowcharts and demonstrated by
the use of modules (procedures) using a menu-based program.
Tasks:
1. State your simple business problems to be solved.
2. Analyse the problem and design the solutions by the use of suitable methods.
3. Demonstrate the compilation and running of a menu-based program
4. Evaluate how the problem is solved from the designed algorithm to the execution program
written by a specific programming language.
You also need to do a presentation of your work (it should be a summary of your report).
LO1 Define basic algorithms to carry out an operation and outline the process of programming an
application
P1 Define what an algorithm M1 Determine the steps taken D1 Examine the implementation
is and outline the process of from writing code to execute. of an algorithm in a suitable
building an application. language. Evaluate the
relationship between the written
algorithm and the code variant.
Contents
I. Introduction ......................................................................................................................................................2
II. P1 Define what an algorithm is and outline the process of building an application........................................2
1. Algorithm ......................................................................................................................................................2
a. Definition ..................................................................................................................................................2
b. The characteristics of the algorithm.........................................................................................................3
c. Example ....................................................................................................................................................4
2. The software production process .................................................................................................................7
a. Definition or Analyzing the problem ........................................................................................................7
b. Design(Algorithm).....................................................................................................................................8
c. Coding .......................................................................................................................................................8
d. Documenting the program .......................................................................................................................8
e. Compiling and running the program ........................................................................................................8
f. Testing and Debugging .............................................................................................................................9
g. Maintenance.............................................................................................................................................9
3. Solving a problem using ng algorithm ..........................................................................................................9
a. Problem ....................................................................................................................................................9
b. Analysis of the program............................................................................................................................9
III. Conclusion ................................................................................................................................................. 11
IV. References ................................................................................................................................................. 11
Page 1
I. Introduction
In this report, I will explain the definition, use examples, how algorithms are used to solve
simple problems, and the steps to take to create a program that works. I have clarified my
program. Problems will be analyzed and designed by me using flowcharts and by using menu-
based programs.
Page 2
task. Algorithms might be expressed in words, computer programs, or code, or even as recipes.
Some algorithms may be simple routines, directions, or processes you use in your daily life. In
computer science, algorithms are represented through a computer program ( or set of computer
programs ) designed to systematically solve certain types of problems.
This means specifying a step-by-step sequence and order of steps to turn input
into output. Algorithms should be clear, unambiguous, and detailed step by
step. If you are ambiguous about something, You can't expect a computer to be
able to understand.
➢ Finiteness
The algorithm must stop. Meaning you will either get the expected output or
will get a response with no possible solution. The algorithm will terminate
after a finite number of steps or after a certain number of steps.
➢ Precise and effective
For an algorithm to be efficient, all the steps to achieve the output must be
feasible given the available resources. It must not contain any redundant or
inefficient steps that make the algorithm misleading. That is the accuracy of the
algorithm
➢ Umnambyguity
A perfect algorithm must be clear and easy to understand
➢ Independence
An algorithm should have step-by-step that are unrelated to any programming
code. It is designed to run with any programming language
Page 3
c. Example
Page 4
3) Step 3: Brew coffee with 30ml of boiling. water and wait 10 minutes
Page 5
5) Step 5: Obtained 40 - 45ml of coffee . . essence
Page 6
7) Step 7: Enjoy the resulting filter
Page 7
b. Design(Algorithm)
Software design is a process of transforming software requirements into a design
representation. The design is to create a representation model of an entity that will later be
built.
c. Coding
- Coding is the process of transforming the design of a system into a computer
language format (for example Java, C++, C#, Python…).
- Coding is done by the coder.
Page 8
- Running a program is the process of executing a program, that will execute the
compiled/built code on emulators, simulators, or devices.
g. Maintenance
-During the use, if the software has any errors or features that customers want to fix.
A maintenance procedure will be created to make modifications.
Page 9
c. Demo
Page 10
III. Conclusion
At last, I conclude that all resources taken in the making of this report belong to their respective
owners. I believe I have explained easily to understand algorithms, definitions, examples, steps
to develop software, and the process by which I create a simple software
IV. References
• Definition algorithm
https://www.techopedia.com/definition/3739/algorithm
Page 11
Lecturer Signature:
Page 12