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, object-orientated and event-driven programming
P2 Give explanations of what procedural, object-orientated and event-driven paradigms are; their characteristics and the relationship between them.
M2 Compare and contrast the procedural, object-oriented and event-driven paradigms used in given source code of an application.
D2 Critically evaluate the source code of an application which implements the procedural, object-oriented and event-driven paradigms, in terms of the code structure and characteristics.
Submission Format
The submission is in the form of a detailed document and a PowerPoint presentation: A detailed report and a 20-25 slide presentation with speaker notes to be presented to your manager. The reports should be written in a concise, formal business style using single spacing and font style times new roman and size 11. You are required to make use of headings, paragraphs and subsections as appropriate, and all work must be supported with research and referenced using the Harvard referencing system. Please also provide a bibliography using the Harvard referencing system. The recommended word limit is specified. The presentation slides (20-25) should be submitted with speaker notes as one copy. You are required to make effective use of PowerPoint headings, bullet points and subsections as appropriate. Your research should be referenced using the Harvard referencing system. The recommended word limit is 2500-3000 words. However, you will not be penalised upon exceeding the word limit. Provide ‘presentation evaluation’ after presenting the work to document your experience, questioning session and teacher’s feedback of the presentation. You should submit your plagiarism report along with your submission. No work will be considered if it contains plagiarism more than the acceptable level defined as per ICMS’s plagiarism policy.
Assignment Scenario and Guidance
Scenario Q-Soft Technologies is a renowned IT Consultancy and Software Development firm in Pakistan operating at national and global level. The company has signed an MOU with IVY School of Management Sciences (ICMS) where the university students are offered internships. You have recently joined the organization as an Intern and you are asked to give a presentation and a detailed report on the following activities and tasks so that your manager can assess your knowledge on basic algorithms used in the programming domain and different programming paradigms. This will help your manager determine your skillset and decide on your placement in the organization. You are required to develop a detailed report with both activities in separate sections and a presentation covering key areas of your activities.
Part A – (LO1) – Guidance
Activity 1: Basics Algorithms In this section, you are required to provide information on the following: You will review the various definitions of algorithms and come up with the most suitable one that you feel deemed fit along with supporting explanation of your choice. You should also outline the role and use of algorithms in designing and programming an application with the help of an example and discuss at least two commonly used algorithms in the programming domain, for example Bubble Sort, Quick Sort, Binary Search etc., with respect to its purpose and operation with the help of pictorial illustrations. You should highlight the steps of application development from writing an algorithm to code generation and its execution. You may include an explanation on the role compilers, debuggers, loaders and executors while outlining your steps. Provide an evaluation of a written algorithm and its code. You should relate the algorithm with its corresponding code in such a way that it details the written algorithm and its implementation in a suitable language (Java or C++) and a detailed evaluation of the output expected from the algorithm and the actual output received from the code. You may use any example of your own choice. However, Appendix A includes an example for your assistance.
Part B – (LO2) – Guidance
Activity 2: Programming Paradigms In this section, you are required to explore the different programming paradigms, Object Oriented, Event Driven and Procedural Programming, and provide information on the following: Explore the different programming paradigms, Object Oriented, Event Driven and Procedural Programming, and provide a detailed explanation of their characteristics, benefits and drawbacks. You are required to support your explanation with relevant code examples and illustrations. You may also include how these paradigms relate to each other through comprehensive comparison and contrast of the different paradigms. You are required to use an example of an application for the three programming paradigms and critically evaluate it in terms of its code structure, characteristics and operation. An example has been provided in Appendix B for your assistance.
Evidence checklist
Summary of evidence required by student
Part A and B
Technical Report (2500-3000 words). Presentation with speaker notes.
Appendix A
Linear Search AlgorithmTake the input array arr[] from user.Take element(x) you want to search in this array from user.Set flag variable as -1LOOP : arr[start] -> arr[end]if match found i.e arr[current_postion] == x thenPrint “Match Found at position” current_position.flag = 0abortAfter loop check flag variable.if flag == -1print “No Match Found”STOP
Linear Search Code in C++ #include < iostream > using namespace std; void linearSearch(int a[], int n) { int temp = -1; for (int i = 0; i < 5; i++) { if (a[i] == n) { cout << “Element found at position: ” << i + 1 << endl; temp = 0; break; } } if (temp == -1) { cout << “No Element Found” << endl; } } int main() { int arr[5]; cout << “Please enter 5 elements of the Array” << endl; for (int i = 0; i < 5; i++) { cin >> arr[i]; } cout << “Please enter an element to search” << endl; int num; cin >> num; linearSearch(arr, num); return 0; }
Appendix B
CALCULATE FACTORIAL OF A NUMBER
Procedural Programming #include<iostream> using namespace std; int factorial(int n); int main() { int n; cout << “Enter a positive integer: “; cin >> n; cout << “Factorial of ” << n << ” = ” << factorial(n); return 0; } int factorial(int n) { if(n > 1) return n * factorial(n – 1); else return 1; }
Object-Oriented Programming #include<iostream> using namespace std; class Test { public: int factorial(int x) { int i, f = 1; for (i = 1; i <= x; i++) { f = f*i; } return f; } }; int main() { int x, f; cout << “Enter a number:”; cin >> x; Test obj; f = obj.factorial(x); cout << “Factorial is:” << f; return 0; }
Event-driven Programming namespace Factorial_app { public sealed partial class MainPage : Page { public MainPage() { this.InitializeComponent(); } protected override void OnNavigatedTo(NavigationEventArgs e) { } private void Button1_click(object sender, RoutedEventArgs e) { int num= Convert.ToInt32(Textbox1.Text); int fact = 1; for (int i = num; i > 0; i–) { fact = fact * i; } text2.Text = fact.ToString(); } } } https://www.c-sharpcorner.com/UploadFile/8ea152/get-factorial-in-windows-store-app/
Order Now ALGORITHMS AND PROGRAMMING PARADIGMS Assignment to www.hndassignmenthelp.com Because we provide assignments delivery on time with Quality. We have more than 7000+ Qualified and Experienced Experts in the team to give you the best online assignment help.
+4474648-84564 