programming language, Assignments of Programming Languages

Download programming language and more Assignments Programming Languages in PDF only on Docsity!

Godrick Naveen KAN/A- 013536

Pearson Higher Nationals in

Computing

Unit 1: Programming Assignment 1

Godrick Naveen - HND in Computing |Programming Assignment 01

Higher Nationals

Internal verification of assessment decisions – BTEC (RQF)

INTERNAL VERIFICATION – ASSESSMENT DECISIONS Programme title (^) HND in Computing Assessor Miss.Shifani Mohideen Internal Verifier Unit(s) Unit 1 – Programming Assignment title Design & Implement a GUI based system using a suitable Integrated Development Environment Student’s name P.V.Godrick Naveen List which assessment criteria the Assessor has awarded. Pass Merit Distinction INTERNAL VERIFIER CHECKLIST Do the assessment criteria awarded match those shown in the assignment brief? Y/N Is the Pass/Merit/Distinction grade awarded justified by the assessor’s comments on the student work? Y/N Has the work been assessed accurately? (^) Y/N Is the feedback to the student: Give details:

• Constructive?
• Linked to relevant assessment criteria?
• Identifying opportunities for improved performance?
• Agreeing actions? Y/N Y/N Y/N Y/N Does the assessment decision need amending? (^) Y/N Assessor signature Date

Godrick Naveen - HND in Computing |Programming Assignment 01 Assessor Feedback: LO1 Define basic algori thms to carry out an operation and outline the process of programming an application. Pass, Merit & Distinction P1 M1 D Descripts LO2 Explain the characteristics of procedural, object- oriented and event-driven programming, Integrated Development Environment (IDE). Pass, Merit & Distinction P2 (^) M Descripts LO3 Implement basic al gorithms in code using an IDE.

D

Pass, Merit & Distinction P3 M3 Descripts D LO4 Determine the deb ugging process and explain the importance of a coding standard. Pass, Merit & Distinction P Descripts

P5 M

D

Grade: Assessor Signature: Date: Resubmission Feedback: Grade: Assessor Signature: Date: Internal Verifier’s Comments: Signature & Date: Assignment Feedback

Godrick Naveen - HND in Computing |Programming Assignment 01 Formative Feedback: Assessor to Student Mention only the important points Action Plan Unnecessary points were removed Summative feedback Thank you for being supportive throughout the assignment. Feedback: Student to As sessor Assessor signature Date Student signature [email protected] Date

Godrick Naveen - HND in Computing |Programming Assignment 01 Academic Year 2020/ Unit Tutor Assignment Title Design & Implement a GUI based system using a suitable Integrated Development Environment Issue Date Submission Date IV Name & Date Submission Format

Godrick Naveen - HND in Computing |Programming Assignment 01 This submission will have 3 components

1. Written Report This submission should be in the form of an individual written report. 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. provide in-text citations, reference list and a bibliography using the Harvard referencing system. ( The recommended word count is 2,00–25,00 words for the report excluding annexures)
2. Implemented System (Software) The student should submit a GUI based system developed using an IDE. The system should connect with a backend database and should have at least 5 different forms and suitable functionality including insert, edit and delete of main entities and transaction processing.
3. Presentation With the submitted system, student should do a presentation to demonstrate the system that was developed. Time allocated is 10 to 15 min. Student may use 5 to 10 PowerPoint slides while doing the presentation, but live demonstration of the system is required. Evaluator will also check the ability to modify and debug the system using the IDE. Unit Learning Outcomes:

Godrick Naveen - HND in Computing |Programming Assignment 01 4.1 The system to calculate vehicle hire amounts and record ...................................... 47 database record for customer billing and management reporting for Ayubo. ............. 47 4.2 What is debugging an application? ........................................................................ 53 4.3 Coding standards .................................................................................................... 56 Task 01 1.1 Algorithm What is algorithm? In computer programming, algorithms are often formed as functions. These functions serve as small programs that can be referenced by a larger program. In many cases, there are several ways to perform a specific operation within a software program. In general term, An algorithm is defined as a set of instructions designed to perform a specific task. Algorithms work via input and output. They take the input and apply each step of the algorithm to that information to produce an output. Characteristics of a good algorithm are,

• Input and output should be defined accurately.
• Each step in the algorithm should be clear and unmistakable.
• Algorithms should be most effective among many different ways to solve a problem.
• An algorithm shouldn't contain computer code. Instead, the algorithm should be written in such a way that it can be used in different programming languages. Linear Search In Linear Search Algorithm method we compare the elements of the array one-by-one with the main element we are looking for in sequential order.The pseudo code for Linear search would be like as given below , BEGIN Index = - 1 i = 0 Found = False

Godrick Naveen - HND in Computing |Programming Assignment 01 WHILE i < length(numlist) AND NOT found IF numlist[i] == numSought then Index = i Found = True Endif i = i + 1 Endwhile Return Index END Binary Search The Binary Search Algorithm can only be applied on sorted data and works by finding the middle element in a list of information, some time recently choosing which side of the information the required element is to be found within. The undesirable half of the data is at that point rejected and the process is repeated until the required element is found or until it is known that the required element doesn’t exist within the data. The Time complexity of linear search is “O(n)” The Pseudo code for Binary Search wouldlike as given below , BEGIN Low = 0 High = a.length - 1 WHILE Low <= High: Mid = (Low + High) / 2 IF a[Mid] == b: Return Mid Else if a[Mid] > b: High = Mid - 1 Else: Low = Mid + 1 Endif

Godrick Naveen - HND in Computing |Programming Assignment 01 Searching for Number “25” in the “array” Iteration 1 5 10 15 20 25 30 35 40 45 50 0 1 2 3 4 5 6 7 8 9 Begins from the leftmost element of given array [] and one by one compare element ”a” with each element of array [] Iteration 2 5 10 15 20 25 30 35 40 45 50 0 1 2 3 4 5 6 7 8 9 It continues searching until either the element “25” is found or all the elements are searched. Iteration 3

Godrick Naveen - HND in Computing |Programming Assignment 01

Iteration 4 5 10 15 20 25 30 35 40 45 50 0 1 2 3 4 5 6 7 8 9 Iteration 4 5 10 15 20 25 30 35 40 45 50 0 1 2 3 4 5 6 7 8 9 Once ”a” equals with any of the element, returns the index value.

Godrick Naveen - HND in Computing |Programming Assignment 01 Searching for Number “30” in the “array” Iteration Low High Mid Found 1 0 9 4 No

Godrick Naveen - HND in Computing |Programming Assignment 01 2 5 9 7 No 3 5 6 5 Yes Iteration 1 5 10 15 20 25 30 35 40 45 50 0 1 2 3 4 5 6 7 8 9 Iteration 2 5 10 15 20 25 30 35 40 45 50 0 1 2 3 4 5 6 7 8 9 Iteration 3 5 10 15 20 25 30 35 40 45 50 0 1 2 3 4 5 6 7 8 9 Once ”a” equals with any of the element, returns the index value.

Godrick Naveen - HND in Computing |Programming Assignment 01 methods that are accessible to us following some methodology. There are lots for programming language that are well-known but all of them need to follow some approaches when they are implemented and this methodology is paradigms. There are two main programming paradigms, an Imperative and a Declarative , and there are numerous paradigms that are inclined by these two types. Imperative Programming Paradigm (Procedural) The main objective of the imperative programming paradigm development is to decrease expenses of program development as well as maintenance. It is a style or method of writing a program. A procedural programming paradigm is derived from structured programming. It is based on the concept of the procedure call. Procedures are also known as sequences, subsequences, approaches, or functions. A Procedure contains a chain of instructions coupled together to be carried out.. Imperative Programming Paradigm is related to two other paradigms

Godrick Naveen - HND in Computing |Programming Assignment 01 Structured Programming Paradigm Structured Programming means that the code will implement the instruction by instruction one after the other. It does not support the possibility of skipping from one instruction to some other with the assistance of any statement like GOTO and variables. Functional Programming Paradigm Functional Programming are specially designed to handle representative computation and list processing applications. Functional programming is based on mathematical functions and avoids changing state and variable data. The characteristics of Procedural Programming are as follows ,

• A huge program is broken down into small convenient procedures or function s. This decreases code repetition, which improves readability and maintainability of the code.
• Different functions can share data through global variables. Functions are completely isolated, therefore if we want to share data, we need to declare it in the upper scope.
• Functions can change global data.