Download BTEC Level 5 HND Diploma in Computing Assignment 1: Algorithm and Search Algorithms and more Assignments C programming 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 20/04/20 22 Date Received 1st submission Re-submission Date Date Received 2nd submission Student Name Le Anh Minh Student ID GCD Class GCD1002 Assessor name Hoang Nhu Vinh 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:
Contents
- Chapter 1 - State your simple business problems to be solved
- 1.1 Overview about Algorithm
- 1.2 Represent a small and simple problem
- Chapter 2 - Analyse the problem and design the solutions by the use of suitable methods
- 2.1 Analyse the problem...................................................................................................................................................................................
- 2.2 Flowchart
- Chapter 3 - Demonstrate the compilation and running of a program
- 3.1 Introduce how the problem is solved
- 3.2 Source code and screen shots of the final result
- 3.3 Explain briefly what is Software Development Life Cycle..........................................................................................................
- 3.4 Explain how the source code is compiled
Chapter 1 - State your simple business problems to be solved
1.1 Overview about Algorithm
An algorithm is simply a set of steps used to complete a specific task. They're the building blocks for programming, and they allow things like computers, smartphones, and websites to function and make decisions. An algorithm will use the input information to perform the required output, using simple formulas in order to solve the problem. The algorithm can be likened to a standard cooking recipe. Using the necessary ingredients, follow the standard processing steps one after the other and complete the dish. Not all cooking methods are standard recipes, just like algorithms, to be an algorithm requires the following characteristics:
Chapter 2 - Analyse the problem and design the solutions by
the use of suitable methods
2.1 Analyse the problem
The problem of finding information in a variable is very common in many applications. For example, library management application, student management, ... to easily find information of a specific object in a large list of information objects.
2.2 Flowchart
Here is flowchart of LinearSearch algorithm:
Chapter 3 - Demonstrate the compilation and running of a
program
3.1 Introduce how the problem is solved
a) Create Array (InputArr): First, to describe how the program solves the problem, we will create an array "arr" to implement the algorithm. b) LinearSearch: Next we will write the LinearSearch algorithm to perform the ID search (the value of the element set in the array). LinearSearch uses a loop (for or while, ..) to compare the value of each element with the element you want to find, if it matches, the result is the element being compared.
- Step 1: Input IDSearch, i = 0, temp = 0.
- Step 2: while I < N ▪ If Arr[i] == IDSearch. temp = temp + 1. Print position no (i+1) of array “Arr”.
3.2 Source code and screen shots of the final result
a) Create and assign values to arrays We input 5 elements: N = 5. Element = {1,3,5,2,4}. b) Searching result:
- Example: Searching result with ID = 5. As we can see, only one the element No 3 have the same number like IDSearch. So here is the result of program:
- Example: Searching result with ID = 6. Now in the array doesn’t have the element with number 6 like IDSearch. So the result of program:
3.3 Explain briefly what is Software Development Life Cycle
Software Development Life Cycle is the application of standard business practices to building software applications. It’s typically divided into six to eight steps: Planning, Requirements, Design, Build, Document, Test, Deploy, Maintain. Some project managers will combine, split, or omit steps, depending on the project’s scope. These are the core components recommended for all software development projects.
3.4 Explain how the source code is compiled
The following illustrates the programming process for a compiled programming language. A compiler takes the program code (source code) and converts the source code to a machine language module (called an object file). Another specialized program, called a linker, combines this object file with other previously compiled object files (in particular run-time modules) to create an executable file. So, for a compiled language the conversion from source code to machine executable code takes place before the program is run. This is a very different process from what takes place for an interpreted programming language. This is somewhat simplified as many modern programs that are created using compiled languages makes use of dynamic linked libraries or shared libraries. Therefore, the executable file may require these dynamic linked libraries (Windows) or shared libraries (Linux, Unix) to run.
