Pearson BTEC L4 IT: Algorithm Report - Building Applications and Code

This report provides a comprehensive overview of algorithms, starting with a definition and exploring various types such as divide and conquer, brute force, greedy, and dynamic programming. It details the process of building an application, outlining essential steps like identifying needs, designing the flow, and integrating analytics. The report further examines the steps from writing code to execution, including defining the problem, planning a solution, coding, testing, and documentation. The author advocates for Python as a suitable language for implementation and explains the relationship between a written algorithm and its corresponding code variant, emphasizing that the algorithm is a human-understandable solution, while the code is the computer-executable version. The report concludes by summarizing the application development process and highlighting the importance of iterative improvements based on user feedback.

PROGRAMMING
Bekzod Boboev
Unit 1: Programming
Lecturer: Muslimbek Pirnazarov
Group ID: L4-IT-1001
Student’s ID:1539
Submission date:16.12.2021

Student ID: 1
BTEC LEARNER ASSESSMENT SUBMISSION AND DECLARATION
When submitting evidence for assessment, each learner must sign a declaration confirming that
the work is their own.
Learner Name: Bekzod Boboev
Assessor Name: Muslimbek Pirnazarov
BTEC Programme Title: Pearson BTEC Level 4 Higher National Diploma
in Information Technology
Unit or Component Number and
Title: Unit 1: Programming
Assignment Title: Algorithm
Date Assignment Submitted: 16.12.2021
Please list the evidence submitted for each task. Indicate the page numbers where the evidence
can be found or describe the nature of the evidence (e.g. video, illustration).
Assignment task reference Evidence submitted
HIGHER NATIONALS IN
COMPUTING CORE TEXTBOOK.
Definition of algorithm, process of building
application.
HIGHER NATIONALS IN
COMPUTING CORE TEXTBOOK
The steps from writing code to execution.
Learner declaration
I certify that the work submitted for this assignment is my own. I have clearly referenced any
sources used in the work. I understand that false declaration is a form of malpractice.
1

Student ID: 2
Learner signature: Date: 16.12.2021
2

Student ID: 3
Table of Contents
1.0. Introduction..................................................................................................................4
2. Research Methodology....................................................................................................4
2.1 Primary Research Method.............................................................................................4
2.2 Secondary Research Method.........................................................................................4
3.0. Research Findings.........................................................................................................5
3.1. P1 Provide a definition of what an algorithm is and outline the process in building an
application.......................................................................................................................................5
4.0. M1 Determine the steps taken from writing code to execution....................................5
5.0. D1 Evaluate the implementation of an algorithm in a suitable language and the
relationship between the written algorithm and the code variant....................................................5
6.0 Conclusion.....................................................................................................................6
Reference list.......................................................................................................................7
Appendices..........................................................................................................................9
List of Tables
3

Student ID: 4
List of Figures
1.0. INTRODUCTION
In this report main topic is algorithm. The definition of algorithm and its types are
shortly given with some pictures to be more understandable. The steps for how to build
an application and during the interval between from writing code to execution, which
steps should be passed are emphasized. At the end of the report questions about
accomplishment of an algorithm in a particular programming language and about what is
the relationship between written and code variants of algorithm are answered.
2. RESEARCH METHODOLOGY
To gather information about algorithms, process of building an application and about
relationship between algorithm and code, some official websites and books are used. Collected
information is analyzed.
4

Student ID: 5
2.1 PRIMARY RESEARCH METHOD
2.2 SECONDARY RESEARCH METHOD
To gather information about algorithms, process of building an application and about
relationship between algorithm and code, some official websites and books are used. Collected
information is analyzed
5

Student ID: 6
3.0. RESEARCH FINDINGS
3.1. P1 PROVIDE A DEFINITION OF WHAT AN ALGORITHM IS AND OUTLINE
THE PROCESS IN BUILDING AN APPLICATION.
Algorithm means collection, sequence of steps to solve given problems, based on going
step by step by a set of specified movements. The word of ‘algorithm’ has different
understandings in several branches. For example, a computer program which is a specific
collection of ordered operations, can be demonstrate as an elaborate algorithm. In
mathematical approach, algorithm can be accepted as a small discipline which can be a solution
of recurrent problem.
There are many types of algorithms, types come from their functions and tasks to
accomplish the task. For presenting an algorithm, some examples of computer science
algorithm types are below:
1. Divide and conquer algorithms. This type is a strategy of solving a real problem by
dividing the problem into sub-problems of the same type. After solving sub-problems,
the solutions of small problems are combined to get a desired output.
2. Brute force algorithm. This is an exclusive solving way that the possible solution for a
problem is uncovered by checking each answer one by one by finding a best solution for
problem. For example, a pin code with 4 digits which is used to open apps in mobile
phone and to open the phone itself, plastic cards and so on. In this case we have ten
numbers from 0 to 9. Imagine, you forgot your installed combination even you do not
remember any number, but you don’t want to waste money to buy new one, thus you
have to use brute force algorithm to open the lock. Then you should enter every
possible 4 possible numbers from 0001, 0002, …, 1234 and so on until the lock is
opened. In the worst-case scenario, it requires a lot of attempts approximately 10,000.
4
3. Randomized algorithm. In his type of algorithm, numbers which are selected randomly,
are used always to find a solution to the problem.
6

Student ID: 7
4. Greedy algorithm. This type of algorithm works for finding an optimal, immediate or
local solution among all solutions for solving the given problem. For to be more
understandable, let’s demonstrate a problem which greedy algorithm is used to find the
most optional solution to solve the problem. For example, fractional knapsack ++
5. Recursive algorithm. By this type of algorithm, first the simplest or lowest problems are
solved then more difficult or higher problems are solved compared with first one and
this process is kept going till solution of the problem is found. The tower of Hanoi can be
the best example for recursive algorithm.
Student id: 1539
6
7

Student ID: 8
6. Backtracking algorithm. This algorithm extracts given problem into separate parts, then
then check them from the first and check the desired solution can be reached or not if
not, backtrack to the problem, until a way is found, which moves action on forward.
7. Dynamic programming algorithms. This type divides a complex problem to normal
problems and keeps their solutions in an array to avoid recomputing their solutions in future.
The process in building an application
There are some compulsory steps which should be passed to build a useful application.
1. Get an idea. If you have already had an idea or problem, you can begin the process from
the second step (identifying the need). If you don’t have any idea, you should find
certain problem which are a lot around you.
2. Identify the need. Determining the quantity of demand for your application is one of
important stages of the process. By researching on how many people need your
application and the degree of consumers’ need, you can identify the need.
3. Lay out the flow and features. The demand for the application means a large of people
need your application, so you should detail it on paper or program.
4. Remove non-core features. In this step you should try to cut unnecessary data like a
‘nice to have’ and the low and features list and provide corn value of the app as much as
possible.
5. Put design first. To achieve success, the interface of the application should be
understandable and attractive because users should try to spend their time on the app.
8

Student ID: 9
6. Hire a developer/designer. Try to find a development team which has a talented team.
Before hiring a developer or designer, check their projects and apps which they did.
6
Student id: 1539
7
7. Create developer account. By registering a developer with a respective app store, you
can get more chances to sell your product through their platform.
8. Integrate analytics. It means to place your data insights solution into per day workflows
and applications and this helps employees and customers to make smarter decisions.
9. Getting rates and insights. When you place the application on app store, first
consumers give their insights to improve the app. Changes and complains are always
occurred, so keep receiving feedbacks and don’t stop building.
4.0. M1 DETERMINE THE STEPS TAKEN FROM WRITING CODE TO EXECUTION.
We have 5 main stages which we should cover from writing code to execution.
I) By defining given problem, we can successfully begin the project. In detail, determining
the purpose of the project and for which auditory the application is.
II) In this stage we should pay attention to plan the most effective solution for the
problem. Planned solution is an important step, because it helps to decrease the time
for doing the project and to make it more useful.
III) It is time to start writing the code, which is one of the most essential parts of the
project.
9

Student ID: 10
IV) After coding, program should be tested to determine its mistakes and check how does it
work. Tester should check each case which can be occurred. After finding mistakes
developers start to repair.
V) The process finished by documenting the program. Documentation is very important
part. Because it represents how to use the program and its design. By making
documentation simple to understand, users start preferring it and of course the price of
program will increase.
5.0. D1 EVALUATE THE IMPLEMENTATION OF AN ALGORITHM IN A SUITABLE
LANGUAGE AND THE RELATIONSHIP BETWEEN THE WRITTEN ALGORITHM
AND THE CODE VARIANT.
During the process of building an application, by which programming language, code
will be written. I prefer to use python which is modern language. Because Python is very fast and
more functional because of lots of frameworks and libraries that are powerful. An algorithm is a
well-designed sequence of steps which leads to the best solution of a complex task. Algorithm is
a variant of solution, which is understandable for human and by looking through the algorithm
people can comprehend which steps should be passed to get a best result. In terms of code
variant, code is a version of solution in a suitable language that computer understands what steps
it should cover. By translating the algorithm into the language which computers can understand,
code is generated.
10

Student ID: 11
6.0 CONCLUSION
To achieve a product, the process starts with understanding the idea and determining the
need for the product. Next steps are choosing an algorithm and writing it and making its design.
The process continues step by step respectively hiring a developer, integrating analytics. In the
last steps are presenting it to public and getting feedback and improvise it quickly. By passing
mentioned steps one by one successfully, the chance of getting a successful product increase.
Word count: 1255
11

Student ID: 12
REFERENCE LIST
book: HIGHER NATIONALS IN COMPUTING CORE TEXTBOOK LEVEL 4
https:// simplicable.com/new/algorithm-vs-code
https://www.programiz.com/dsa/backtracking-algorithm
https://medium.com/javarevisited/when-to-use-greedy-algorithms-in-problem-solving-
a081d5867186
12

Student ID: 13
BIBLIOGRAPHY
13

Student ID: 14
APPENDICES
APPENDIX 1
14

Student ID: 15
APPENDIX 2
15