Programming Assignment, Assignments of Programming for Engineers

tis document contain the guidance to successfully complete the pearson programming assignment

Typology: Assignments

2020/2021

Uploaded on 04/25/2021

lakshan-raman
lakshan-raman 🇱🇰

4.6

(6)

1 document

1 / 68

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Higher NationalsInternal verification of assessment decisions – BTEC (RQF)
INTERNAL VERIFICATION – ASSESSMENT DECISIONS
Programme title
Assessor Internal
Verifier
Unit(s)
Assignment title
Student’s name
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
Internal Verifier signature Date
Programme Leader signature (if required)
Date
Confirm action completed
Remedial action taken
Give details:
Assessor signature Date
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44

Partial preview of the text

Download Programming Assignment and more Assignments Programming for Engineers in PDF only on Docsity!

Higher Nationals Internal verification of assessment decisions – BTEC (RQF) INTERNAL VERIFICATION – ASSESSMENT DECISIONS Programme title Assessor Internal Verifier Unit(s) Assignment title Student’s name 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 Internal Verifier signature Date Programme Leader signature (if required) Date Confirm action completed Remedial action taken Give details: Assessor signature Date

Internal Verifier signature Date Programme Leader signature (if required) Date

Higher Nationals - Summative Assignment Feedback Form

Student Name/ID Unit Title Assignment Number Assessor Submission Date Date Received 1st submission Re-submission Date Date Received 2nd submission Assessor Feedback: LO1. Define basic algorithms to carry out an operation and outline the process of programming an application. Pass, Merit & Distinction Descripts

P1 M1 D

LO2. Explain the characteristics of procedural, object-orientated and event-driven programming, conduct an analysis of a suitable Integrated Development Environment (IDE). Pass, Merit & Distinction Descripts

P2 M2 D

LO3. Implement basic algorithms in code using an IDE. Pass, Merit & Distinction Descripts

P3 M3 D

LO4. Determine the debugging process and explain the importance of a coding standard. Pass, Merit & Distinction Descripts

P4 P5 M4 D

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

General Guidelines

  1. A Cover page or title page – You should always attach a title page to your assignment. Use previous page as your cover sheet and be sure to fill the details correctly.
  2. This entire brief should be attached in first before you start answering.
  3. All the assignments should prepare using word processing software.
  4. All the assignments should print in A4 sized paper, and make sure to only use one side printing.
  5. Allow 1” margin on each side of the paper. But on the left side you will need to leave room for binging. Word Processing Rules
  6. Use a font type that will make easy for your examiner to read. The font size should be 12 point, and should be in the style of Time New Roman.
  7. Use 1.5 line word-processing. Left justify all paragraphs.
  8. Ensure that all headings are consistent in terms of size and font style.
  9. Use footer function on the word processor to insert Your Name, Subject, Assignment No, and Page Number on each pag e. This is useful if individual sheets become detached for any reason.
  10. Use word processing application spell check and grammar check function to help edit your assignment. Important Points:
  11. Check carefully the hand in date and the instructions given with the assignment. Late submissions will not be accepted.
  12. Ensure that you give yourself enough time to complete the assignment by the due date.
  13. Don’t leave things such as printing to the last minute – excuses of this nature will not be accepted for failure to hand in the work on time.
  14. You must take responsibility for managing your own time effectively.
  15. If you are unable to hand in your assignment on time and have valid reasons such as illness, you may apply (in writing) for an extension.
  16. Failure to achieve at least a PASS grade will result in a REFERRAL grade being given.
  17. Non-submission of work without valid reasons will lead to an automatic REFERRAL. You will then be asked to complete an alternative assignment.
  18. Take great care that if you use other people’s work or ideas in your assignment, you properly reference them, using the HARVARD referencing system, in you text and any bibliography, otherwise you may be guilty of plagiarism.
  19. If you are caughtplagiarising you could have your grade reduced to A REFERRAL or at worst you could be excluded from the course.

Student Declaration I hereby, declare that I know what plagiarism entails, namely to use another’s work and to present it as my own without attributing the sources in the correct way. I further understand what it means to copy another’s work.

  1. I know that plagiarism is a punishable offence because it constitutes theft.
  2. I understand the plagiarism and copying policy of the Edexcel UK.
  3. I know what the consequences will be if I plagiaries or copy another’s work in any of the assignments for this program.
  4. I declare therefore that all work presented by me for every aspects of my program, will be my own, and where I have made use of another’s work, I will attribute the source in the correct way.
  5. I acknowledge that the attachment of this document signed or not, constitutes a binding agreement between myself and Edexcel UK.
  6. I understand that my assignment will not be considered as submitted if this document is not attached to the attached. Student’s Signature: Date: ( Provide E-mail ID ) ( Provide Submission Date )

Unit Learning Outcomes:

LO1. Define basic algorithms to carry out an operation and outline the process of

programming an application.

LO2. Explain the characteristics of procedural, object-orientated and event-driven

programming, conduct an analysis of a suitable Integrated Development

Environment (IDE).

LO3. Implement basic algorithms in code using an IDE.

LO4. Determine the debugging process and explain the importance of a coding

standard

Assignment Brief and Guidance:

Task 1:Define basic algorithms to carry out an operation and outline the process of

programming an application (LO1)

Searching on an array/list is to find a given element on the array and return whether

it is found or not and return its position if found. Linear search and binary search are

two popular searching algorithms on arrays.

1.1 Define what an algorithm is and outline the characteristics of a good algorithm.

Develop algorithms for linear search and binary search using Pseudocode (P1).

1.2--Describe the steps involve in the process of writing and executing a program.

Take an array of 10 or more elements and dry run the above two algorithms. Show

the outputs at the end of each iteration and the final output (M1).

1.3.Define what Big-O notation is and explain its role in evaluating efficiencies of

algorithms. Write the Python program code for the above two algorithms and

critically evaluate their efficiencies using Big-O notation (D1).

Task 2: Explain the characteristics of procedural, object-orientated and event-driven

programming, conduct an analysis of a suitable Integrated Development

Environment (LO2).

2.1 Define what is meant by a Programming Paradigm. Explain the main

characteristics of Procedural, Object oriented and Even-driven paradigms and

the relationships among them(P2).

2.2 Analyze the features of an Integrated Development Environment (IDE) and

explain how those features help in application development (M2).

2.3 Write small snippets of code as example for the above three programming

paradigms using a suitable programming language(s)and critically evaluate their

structure and the characteristics (D2).

Ayubo Drive is the transport arm of Ayubo Leisure (Pvt) Ltd, an emerging travel &

tour company in Sri Lanka. It owns a fleet of vehicles ranging from cars, SUVs to

vans.

The vehicles that it owns are hired or rented with or without a driver. The tariffs are

based on the vehicle type. Some of the vehicle types that it operates are, small car,

sedan car, SVUs, Jeep (WD), 7-seater van and Commuter van. New vehicle types are

to be added in the future.

3.3 What is the purpose of using an IDE in application development? Evaluate the

use of the Visual StudioIDE for your application development contrastedwith not

using an IDE. (D3).

Task 4:Determine the debugging process and explain the importance of a coding

standard (LO4).

Design and build a complete system for the vehicle reservation and billing for

Ayubo drive. This includes the completing the database design started in 3.2 and

designing the suitable interfaces for vehicle and package additions and

reservation handling and customer billing (P4).

4.1 What is debugging an application? Explain the importance of the debugging

facility in Visual studio IDE. Debug your source code by putting few debugging

points in your application (P4).

4.2 Implement the above functionalities using the IDE while adopting the coding

standards to improve maintainability of the code. Explain the coding standards

used in your code in the written report (P5).

4.3 Evaluate how you used the debugging process to develop more secure, robust

application with examples (M4).

4.4 Explain the coding standards you have used in your application development.

Critically evaluate why a coding standard is necessary in a team as well as for the

individual. (D4).

Page 17 Grading Rubric

Grading Criteria Achieved Feedback

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 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

LO2 Explain the characteristics of procedural, objectorientated and

event-driven programming, conduct an analysis of a suitable

Integrated Development Environment (IDE)

P2 Give explanations of what procedural, objectorientated, and

eventdriven paradigms are; their characteristics and the

relationship between them.

M2 Analyze the common features that a developer has access to in

an IDE.

D2 Critically evaluate the source code of an application which

implements the programming paradigms, in terms of the code

structure and characteristics.

LO3Implement basic algorithms in code using an IDE.

P3 Write a program that implements an algorithm using an IDE.

M3 Use the IDE to manage the development process of the program.

D3 Evaluate the use of an IDE for development of applications

contrasted with not using an IDE.

Page 17

Programming

Assignment

Design & Implement a GUI based

system using a suitable Integrated

Development Environment

BY Tharaka Fernando

Page 17

  • ACKNOWLEDGEMENT

I have taken efforts in this project more. However, it would not have been possible without

the kind support and help of many individuals and organizations. I would like to extend my

sincere thanks to all of them.

I would like to express my thanks to the people who have helped me most throughout my

project. I am grateful to my teachers for nonstop support for the project. Their assistance and

insightful comments, and who willingly shared their expertise with me.

A special thank of mine goes to my colleagues who helped me out in completing the project,

where they all exchanged their own interesting ideas, thoughts and made this possible to

complete my project with all accurate information.

I would like to express my gratitude towards members of BTEC batch 27 for their kind co-

operation and encouragement which help me in completion of this project. I would like to

express my special gratitude and thanks to industry persons for giving me such attention and

time.

Finally, to my family members who gave moral support for me to complete the project duly

and deepest gratitude. Their constant encouragement without which this assignment would

not be possible.

W.TharakaFernando

 - Page 
  •  ACKNOWLEDGEMENT..................................................................................................................
  •  Task 1:..........................................................................................................................................
    • 1.1....................................................................................................................................................
      • What an algorithm is ?.................................................................................................................
      • What makes a good algorithm?....................................................................................................
      • What are the qualities of a good algorithm?................................................................................
      • What is linear and binary search ?...............................................................................................
      • Develop algorithms for linear search and binary search using Pseudocode.................................
    • 1.2....................................................................................................................................................
      • five main ingredients in the programming process......................................................................
      • Linear Search in Console Application.........................................................................................
      • Linear searchdesk check..............................................................................................................
      • Binary Searchdesk check.............................................................................................................
    • 1.3....................................................................................................................................................
      • What does Big O Notation mean?................................................................................................
      • Its role in evaluating efficiencies of algorithms...........................................................................
      • For Python program code the above two algorithms....................................................................
      • critically evaluate their efficiencies using Big-O notation...........................................................
  •  Task 2:..........................................................................................................................................
    • 2.1....................................................................................................................................................
      • What is a programming paradigm?..............................................................................................
      • What are Procedural, Event Driven and Object Orientated Programming...................................
      • paradigms?................................................................................................................................... What are the relationships between programming procedural, object-oriented and even-driven
    • 2.2....................................................................................................................................................
      • What is IDE with example?.........................................................................................................
      • What are the main features of an IDE?........................................................................................
      • BASIS IDE Features?..................................................................................................................
      • few sample explain with BASIS IDE Features............................................................................
    • 2.3....................................................................................................................................................
      • Using a JAVA programming language.......................................................................................
      • Procedural programming in Java.................................................................................................
        • Page
      • Object oriented programming in Java..........................................................................................
      • Even-driven programming in Java..............................................................................................
      • critically evaluate their structure and the characteristics..............................................................
  •  Task 3:..........................................................................................................................................
    • 3.1....................................................................................................................................................
      • Function 1: Rent calculation........................................................................................................
      • Function 2: Day tour - hire calculation........................................................................................
      • Function 3: Long tour - hire calculation......................................................................................
    • 3.2....................................................................................................................................................
      • Visual Studio Application............................................................................................................
    • 3.3....................................................................................................................................................
      • What is the purpose of using an IDE in application development?..............................................
      • using an IDE................................................................................................................................ Evaluate the use of the Visual Studio IDE for your application development contrasted with not
  •  Task 4:..........................................................................................................................................
    • 4.1....................................................................................................................................................
      • What is debugging an application?..............................................................................................
      • Few debugging points in application..........................................................................................
    • 4.2....................................................................................................................................................
      • Improve maintainability of the code............................................................................................
      • used in some coding standards.....................................................................................................
    • 4.3....................................................................................................................................................
    • 4.4....................................................................................................................................................
      • Explain the coding standards you have used in your application development............................
      • Critically evaluate why a coding standard is necessary in a team as well as for the individual....
  •  Gantt Chart..................................................................................................................................
  •  HARVARD reference....................................................................................................................
  •  Bibliography.................................................................................................................................
    • Page
  • Figure 1 : Algorithms........................................................................................................................... Table Figure
  • Figure 2 : What make a good Algorithm.............................................................................................
  • Figure 3 : Linear search........................................................................................................................
  • Figure 4 : Binary search.......................................................................................................................
  • Figure 5 : Defining the problem...........................................................................................................
  • Figure 6 : Planning the solution...........................................................................................................
  • Figure 7 : Coding the program.............................................................................................................
  • Figure 8 : Documenting the program...................................................................................................
  • Figure 9 : Linear search in console application....................................................................................
  • Figure 10 : Linear search output..........................................................................................................
  • Figure 11 : Linear search with elements..............................................................................................
  • Figure 12 : Binary search inconsole application..................................................................................
  • Figure 13 : Binary search output.........................................................................................................
  • Figure 14 : Big-oh Notation..................................................................................................................
  • Figure 15 : Linear search for python....................................................................................................
  • Figure 16 : Linear search for python : output......................................................................................
  • Figure 17 : Binary search for python....................................................................................................
  • Figure 18 : Binary search for python : output......................................................................................
  • Figure 19 : Linear search& Binary Search Compare 1..........................................................................
  • Figure 20 : Linear search & Binary Search Compare 2.........................................................................
  • Figure 21 : programming paradigm 1..................................................................................................
  • Figure 22 : programming paradigm 2..................................................................................................
  • Figure 23 : Procedural Programming...................................................................................................
  • Figure 24 : Object oriented programming...........................................................................................
  • Figure 25 : Procedural ,Object oriented, Event-driven programming compare 1...............................
  • Figure 26 : Procedural ,Object oriented, Event-driven programming compare 2...............................
  • Figure 27 : IDE example picture...........................................................................................................
  • Figure 28 : Example Picture.................................................................................................................
  • Figure 29 : NetBean IDE logo...............................................................................................................
  • Figure 30 : Event_drivenProframming.................................................................................................
  • Figure 31 : Example picture 1..............................................................................................................
  • Figure 32 : Example picture 2..............................................................................................................
  • Figure 33 : Example picture 3..............................................................................................................
  • Figure 34 : Guntt Chart........................................................................................................................

Page 17

What are the qualities of a good algorithm?

The characteristics of a good algorithm are:

 Precision –the steps are precisely stated(defined).

 Uniqueness– results of each step are uniquely definedand only depend on the

-input and the result of the precedingsteps.

 Finiteness – the algorithm stops after a finite number ofinstructions are

-executed.

 Input – the algorithm receives input.

 Output – the algorithm produces output.

 Generality – the algorithm applies to a set ofinputs.

[ CITATION che03 \l 1033 ]

What is linear and binary search?

A linear search starts at the beginning of a list of values, and checks 1 by 1 in order for the

result you are looking for. A binary search starts in the middle of a sorted array, and

determines which side (if any) the value you are looking for is on.

 Linear search

Linear search is a very simple search

algorithm. In this type of search, a

sequential search is made over all items

one by one. Every item is checked and if a

match is found then that particular item is

returned, otherwise the search continues

till the end of the data collection.

 Binary search

Binary search is a fast search algorithm

with run-time complexity of Ο(log n).

This search algorithm works on the

principle of divide and conquer. For this

algorithm to work properly, the data

collection should be in the sorted form.

Figure 3 : Linear search Figure 4 : Binary search

Page 17

Develop algorithms for linear search and binary search using Pseudocode.

 Algorithm for linear search:

Linear search (Array A,Size n, Value x)

Step 1: Set i to 1

Step 2: if i>n then go to step 7

Step 3: if A[i]=x then go to step 6

Step 4: Set i to i+

Step 5: Go to step 2

Step 6: Print element x fund at index i and go to step 8

Step 7: Print element not found Step

Step 8: Exit

 Pseudo code for linear search:

 Algorithm for Binary search:

LinearSearch( A , n , x ) A= Array , n =Size , x = target element

For i=0 to n -

If ( A[i] == x )

Return i

Retrun -i