BTEC HND Computing Assignment: Problem Solving with Algorithms - Prof. 1618, Study Guides, Projects, Research of Programming Languages

An assignment brief for a BTEC Level 5 HND Diploma in Computing unit titled 'Programming'. Students are required to explain how algorithms are used to solve simple business problems and produce a working program solution. The assignment includes defining algorithms, their characteristics, and steps in program development. References are provided in Harvard style.

Typology: Study Guides, Projects, Research

2021/2022

Uploaded on 08/01/2022

ke-danh-cap-trai-tim
ke-danh-cap-trai-tim 🇻🇳

4.6

(31)

7 documents

1 / 14

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
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
Student ID
Class
Assessor name
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
Grading grid
P1
M1
D1
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe

Partial preview of the text

Download BTEC HND Computing Assignment: Problem Solving with Algorithms - Prof. 1618 and more Study Guides, Projects, Research Programming Languages in PDF only on Docsity!

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 Student ID Class Assessor name 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 Grading grid P1 M1 D

 Summative Feedback:  Resubmission Feedback:

Grade: Assessor Signature: Date: Lecturer Signature:

LO1 Define basic algorithms to carry out an operation and outline the process of programming an application Assignment Brief and Guidance: Assignment 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, conditional statements. Problems should be analysed and designed by the use of flowchart and demonstrated by the use of modules (procedures). Tasks:  State your simple business problems to be solved.  Analyse the problem and design the solutions by the use of suitable methods.  Demonstrate the compilation and running of a program  Evaluate how the problem is solved from the designed algorithm to the execution program written by a specific programming language. Learning Outcomes and Assessment Criteria (Assignment 1): Learning Outcome Pass Merit Distinction LO1 P1 Provide a definition of what an algorithm is and outline the process in building an application. M1 Determine the steps taken from writing code to execution. D1 Examine the implementation of an algorithm in a suitable language. Evaluate the relationship between the written algorithm and the code variant.

Table of Contents

  • Assignment Brief 1 (RQF)
    • Higher National Certificate/Diploma in Computing
  • Assignment
    • I. State my simple business problems to be solved
        1. Definition an algorithm
        1. Characteristics of an algorithm
        1. Steps in Program Development
      • to solve it................................................................................................................................................... 4. Represent a small and simple problem, why it is needed to be solved and how a algorithm could help
    • II. Analyze the problem and design the solutions by the use of suitable methods
  • References.........................................................................................................................................................

List of tables

Table 1 Advantages and Disadvantages of Algorithm (RishabhPrabhu, 2022) ................................................. 9 Table 2 Specifying the input requirements ....................................................................................................... 12 Table 3 Specifying the output requirements ..................................................................................................... 12

Assignment 1 I. State my simple business problems to be solved

1. Definition an algorithm According to (RishabhPrabhu, 2022),the term "algorithm" refers to "a collection of rules to be followed in calculations or other problem-solving procedures" or "a process for solving a mathematical problem in a finite number of steps, sometimes using recursive operations." As a result, an algorithm is a set of discrete procedures for solving a certain problem. Figure 1 Algorithm (RishabhPrabhu, 2022) 2. Characteristics of an algorithm According to (RishabhPrabhu, 2022), as opposed to using the normal recipe's printed directions, one would not follow them. In a similar vein, not all computer instructions written down are algorithms. Some instructions must meet the following requirements in order to qualify as an algorithm:

3. Steps in Program Development Figure 3 Steps in Program Development (Nakov, et al., 2014) Analyzing or Defining the Problem:  The problem is defined by doing a preliminary investigation  Defining a problem helps us to understand problem clearly  It is also known as Program Analysis Design:  A design is the path from the problem to a solution in code  The well designed program is likely to be:

o Easier to read and understand later o Less of bugs and errors o Easier to extend to add new features o Easier to program in the first place Coding:  An algorithm expressed in programming languages is called Program  Writing a program is called Coding  The logic that has been developed in the algorithm is used to write program Documentation:  Document explains o How the program works and how to use the program (user manual) o How to maintain the program (developer manual)  Details of particular programs, or particular pieces of programs, are easily forgotten or confused without suitable documentation Testing:  Testing is the process of executing a program with the deliberate intent of finding errors  Testing is needed to check whether the expected output matches the actual output  Testing is done during every phase of program development  Initially, requirements can be tested for its correctness  Then, the design (algorithm, flow charts) can be tested for its exactness and efficiency Debugging:  Debugging is a process of correcting the errors o Programs may have logical errors which cannot be caught during compilation o Debugging is the process of identifying their root causes o One of the ways is to print out the intermediate results at strategic points of computation o Another way is to use support from the IDE  Testing vs Debugging o Testing means detecting errors o Debugging means diagnosing and correcting the root causes Maintenance:  Program maintenance o Continuing process of maintenance and modification o To keep pace with changing requirements and technologies  Maintainability of the program is achieved by o Modularizing it o Providing proper documentation for it o Following standards and conventions (naming conventions, using symbolic constants, etc.) (Nakov, et al., 2014)

4. Represent a small and simple problem, why it is needed to be solved and how a algorithm could help to solve it Due to the overwhelming number of students, it takes the teacher a long time to identify the kid with the highest grade, and this delay may cause incorrect rewards to be awarded. My algorithm can help teachers find the pupil with the highest grade quickly and precisely.

Flowchart:

References cseworldonline, 2020. cseworldonline. [Online] Available at: https://www.cseworldonline.com/articles/stages-of-program-development-process.php Nakov, S., Kole, V. & Team, N., 2014. Fundamentals of Computer Programming with C#. 1st ed. s.l.:Faber Publishing. RishabhPrabhu, 2022. geeksforgeeks. [Online] Available at: https://www.geeksforgeeks.org/introduction-to-algorithms/?ref=lbp