Summary UNIT NO. & TITLE: No. 1 Programming

UNIT NO. & TITLE: No. 1 Programming


QUALIFICATION: BTEC Level 4 Computing


YEAR: 2020


PREPARED BY: Kunwar Singh


REPORT


ASSESSOR NAME: Ms. Saba shaikh


SUBMITTED ON:




1

, INDEX
No. Title Page
No.
1. LO1: Define basic algorithms to carry out an operation
and outline the process of programming an application.
P1: Provide a definition of what an algorithm is and 3
outline the process in building an application.
M1: Determine the steps taken from writing code to 4-6
execution.
2. LO2: Explain the characteristics of procedural, object-
oriented and event-driven programming, conduct an
analysis of suitable Integrated Development Environment
(IDE)
P2: Give explanations of what is procedural, object- 7-8
oriented and event-driven paradigms are; their
characteristics and the relationship between them.
M2: Analyze the common features that an developer has 9-11
access to in an IDE.
3. LO3: Implement basic algorithms in code using an IDE
P3: Write a program that implements an algorithm using 12-14
an IDE
M3: Use the IDE to manage the development process of 15-17
the program.
4. LO4: Determine the debugging process and explain the
importance of a coding standard.
P4: Explain the debugging process and explain the 18-20
debugging facilities available in the IDE.
P5: Outline the coding standard you have used in your 21-26
code.
M4: Evaluate how the debugging process can be used to 27-30
help develop more secure, robust applications.
5. Reference 31




2

,LO1: Define basic algorithms to carry out an operation and outline the
process of programming an application
P1: Provide a definition of what an algorithm is and outline the process of
building an application.


Definition of Algorithm:
• An algorithm is well-defined steps of a process for resolving a particular problem.
The algorithm is a defined a set of instructions. Another way of step by step solution
can be represented by flowchart or pseudo code.
• An algorithm is also used for manipulating data, such as adding new data items,
searching for particular data items. The specific aim of an algorithm is for some
specific output.

Algorithm Process of building an application:
• Sorting: It first thing in the algorithm where we need to decide certain order or series
of instructions to get specific output.
• Search: Algorithm is developing to search step by step procedure to find data specific
location inside a data structure.
• Delete: Algorithm is developing to delete some data items from a specific location
from the data structure.
• Insert: Algorithm is developing to insert some specific data item inside of existing
data structure.
• Update: Algorithm is developing to update data items inside an existing data
structure.
• Time Complexity: In which it is representing the amount of time taken to run the
program.
• Space Complexity: Where the specific amount of space in memory is required by an
algorithm. Space Complexity is required where there are multi-user but limited
memory in the system is available




3

, M1: Determine steps taken from writing code to execution.
Write a program using three variables, to do arithmetic operation addition,
subtraction, division, and multiplication.


#include<iostream.h>
#include<conio.h>
void main()
{
int x, y, z;
cout<<” Enter Values of X and Y for Addition” <<endl;
cin>>x>>y;
z=x + y;
cout<<” Addition of two numbers = “<<z<<endl;
cout<<” Enter Values of X and Y for Subtraction” <<endl;
cin>>x>>y;
z=x - y;
cout<<” Subtraction of two numbers = “<<z<<endl;
cout<<” Enter Values of X and Y for Division” <<endl;
cin>>x>>y;
z=x / y;
cout<<” Division of two numbers = “<<z<<endl;
cout<<” Enter Values of X and Y for Multiplication” <<endl;
cin>>x>>y;
z=x * y;
cout<<” Multiply of two numbers = “<<z<<endl;
getch();
}



4