+91-9519066910
USA: +1(585)6662225, IN: +91-7503070001, IN:+91-9519066910

Assignment

Computing Skills Assignment Help

Matlab Assignment Help

Algorithm programming assignment help

Rating:
Algorithm programming assignment help

Algorithm programming assignment help

Introduction

This report will provide clear information over the algorithm. This report will complete the description of algorithms using a various different approach. This report will describe all the characteristics of various paradigms such as Object-oriented, procedural language, Event-driven programming. This report will consist of a detailed comparison over all the three different programming languages.

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

P1 provides a definition of what an algorithm is and outline the process of building an application.

Programming Algorithm:-

Programming algorithm is basically a type of recipe which explains the exact procedure required for the system to crack any hitch or to attain a particular goal. It’s just like when a particular dish or something is to be made, there are a particular step and procedure for that, like ingredients, and what is to be done first and how much time that step will take, then further what next. So, in the world of the computer, the recipe is referred to as a ‘Procedure’ and ingredients as ‘Inputs’. The computer system takes a glance at the procedure, follows it and then allows the user to see the result, which is considered as an ‘Output’. The Programming Algorithm describes the way or method of doing something, and the computer system does its exact same manner. But there is a reminder that the programming algorithm is not any sort of computer code. It is simply written in English or in any other language which the programmer speaks. There is not any sort of blabbering in the coding or any long discussions, it just simply has a start, mid part and an end. On top of it, there is always a major possibility that there will be just two things, i.e. start and the end. It will only include what is in need or carrying the task. It doesn’t have any sort of lengthy procedures. Also, It doesn’t have ambiguous. A Programming Algorithm will always lead directly to a solution, and the solution is always efficient. There can be many steps, but keeping the number of steps minimum is better, as there is no possibility of any sort of misconception or any misunderstanding.

Programming Algorithm Example:

An algorithm can be might be written in the form of any list of all the steps or in any flowchart manner in which everything will be explained in the form of shapes and arrows.

Examples of both the algorithm are as follows:

A stepwise manner:

In a stepwise manner, the algorithm consists of the catalogue of steps manner wise like following. Following is a simple algorithm generated in order to receive an email address. Like there will be simply a numbered list of steps in a simple English language, not even in a very complicated manner.

Step 1: Start

Step 2: the user’s email address is going to be accepted through building a variable.

Step 3: Variable has to be cleared in case if it is not empty.

Step 4: Email address of the user is going to be needed.

Step 5: Collect the comeback invariable.

Step 6: Email address is going to be checked by seeing the responses that are stored inside it.

Step 7: If obtained address is not valid then move to step 3.

Step 8: End

LINEAR SEARCH ALGORITHM

LinearSearch(Array arr, Value a)

1) Start

2) For k to n

3) If k > n , go to step 9

4) If arr[] ==a , go to step 7

5) For k to k+1

6) Go to step 3

7) Print the value a and the index of a , go to step 8

8) Else Print “Not Found”

9) End

Now we implement the linear search in C language.

Steps :

1) Make a main function .

2) In main function we take variables array[100], search ,c and n.

3) Now take input from user for entering the number of element .

4) Now print the integer and introduced the for loop to scan the array list.

5) Now again take input from user for entering the element that need to be searched.

6) For loop to check the array is equal to the search .

7) If it is equal then print the index of the searched value.

8) If it is not then print “It is not found”.

Figure 1:linear search source code

Output:-

Figure 2: output

BINARY SEARCH ALGORITHM

1) Start

2) First find the middle element of the array list by using formula(upper bound –lower bound/2).

3) If we found the value , return the index and value.

4) If it is not found then ,analysis the position .

5) Break the arraylist and find new middle element by using formula.

6) If the value is greater than the middle element then, search in right array list.

7) If the value is smaller than the middle element then, search in left array list.

8) If value is not found ,goto step 5.

9) End

Now we implement the Binary search in C language.

Binary search

1) Include header file

2) Make main function .

3) In main function variables are c, first ,last, middle, n .search, array[100].

4) Now take input from user to enter the number of elements

5) Print the integer.

6) For loop to scan the array.

7) Now again take input from user for entering the element that need to be searched.

8) Now assign first =0, last =n-1, amd middle =(first + last)/2;

9) And while loop with condition(first<= last)

10) Check if array of middle is less than search if yes then first= middle +1.

11) Again check if array of middle is equal to search then print “found at location ”

12) Print search and middle +1.

 

 Figure :3 Binary search source code

Flowchart manner:

In a flow chart manner also, the algorithm is always expressed in a very simple manner. Like there is a button which is the same as an algorithm, but the only difference is, that it consists of arrows and shapes, simply like a map.

So, in the above flowchart, the following things are explained stepwise.

Step 1 is simply a sort of a reminder notifying that there exists a procedure having a beginning and an end.

In Step 2, there is created a place in the computer for storing the variable.

In step 3, the variable is cleared, because it might be used again, and by deleting it, there will be no chance of content mixing.

In step 4, the user of an email address is been prompted.

In step 5, the user has to stick in the nifty variable.

In Step 6, the computer is commanded to have a close look at this email address, like is it correct or not (Meinecke, 2018). 

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

P2 Give an explanation of what procedural, object-oriented and event-driven driven paradigms and their characteristics and the relationship between them.

Procedural Paradigm:-

This is a programming prototype which uses a proper top to bottom technique, i.e. it analyzes a sequence of a properly arranged stages and steps in the framework of its programming to develop a program. And within this, every commands, functions and statement are properly arranged in a systematic way to complete an entire task or a program. This procedural programming language is also defined as an Imperative language. As the name of this programming itself suggests that this language depends or existing organized events or functions which already are in the design of the structure of the program, which states all the parts which are in the system and helps to reach the desired state.

Object-oriented programming (OOP):-

This is a sort of a programming language of a computer system in which all the other operations are needed to be defined alongside the types of the data of the structural data. Therefore, the structure of the data develops like an object, which has all the functions along the data. And, with this, the programmers can create a connection between both objects

Event-driven programming:-

This program targets events like a base for developing the software. These events are those which might be used by the users, and the concept of this sort of programming is the importance of the application and the programming development.

Characteristics:

Procedural Programming

• In this, the transfer of the information is done from one form of the function to the other form.

• It mainly focuses on the things which are to be done.

• Mostly, all of its functions share the global sort of data.

• If there are some big functions, then, in that case, all those large functions are further divided into smaller functions.

• In order to protect data of the function from others, there does not have any such techniques are available like appropriate and effective ones.

Object-oriented Programming

• Inheritance: This is a sort of character in which the classes and objects can have the properties or the characteristics from the parent class.

• Encapsulation: In this characteristic of the OOP, data cannot be directly accessed, because the data is already hidden. And to have that data, there is a necessity that they must interact with the object, which will be responsible for the data.

• Abstraction: Whenever two totally different objects interact with a similar object, they in turn handle with the various set of attributes. • Objects: These are basically a sort of structures which interact with the data, and there working measures.

• Polymorphism: This is basically done by the help of the overloading process.

Event-driven Programming

• Events

• Parameter passing

• Procedures

• Local variables

• Event handlers

• Time-driven

• Pre-defined functions

• Modularity

• Programming Libraries

• Global variables

• Trigger functions

• Service-oriented

Diffrences between these three programming paradigms:

Conclusion

This report had provided a clear description of the algorithm with its required elements and information. This report had provided all the elements. This report had provided detailed information on all the essential component of the algorithm. This report had provided us with detailed information. This report had provided also provides a detailed understanding.  

References:

Algoritihims (2018). Algorithms for Procedural Content Generation - Procedural Content Generation Wiki. [online] Available at: http://pcg.wikidot.com/category-pcg-algorithms [Accessed 15 Dec. 2018].

Bracha, G., & Ungar, D. (2015). OOPSLA 2004: mirrors: design principles for meta-level facilities of object-oriented programming languages. ACM SIGPLAN Notices, 50(8), 35-48.

Hsiao, C. H., Yu, J., Narayanasamy, S., Kong, Z., Pereira, C. L., Pokam, G. A., ... & Flinn, J. (2014). Race detection for event-driven mobile applications. ACM SIGPLAN Notices, 49(6), 326-336.

Jordan, H., Botterweck, G., Noll, J., Butterfield, A., & Collier, R. (2015). A feature model of actor, agent, functional, object, and procedural programming languages. A science of Computer Programming, 98, 120-139.

Lonny Meinecke (2018). What is an Algorithm in Programming? - Definition, Examples & Analysis - Video & Lesson Transcript | Study.com. [online] Available at: https://study.com/academy/lesson/what-is-an-algorithm-in-programming-definition-examples-analysis.html [Accessed 15 Dec. 2018].

Visual Studio. (2019). Editing Code in Visual Studio IDE | Visual Studio - Visual Studio. [online] Available at: https://visualstudio.microsoft.com/vs/features/ide/ [Accessed 16 Jan. 2019].

Programmingsimplified. (2019). C program for binary search | Programming Simplified. [online] Available at: https://www.programmingsimplified.com/c/source-code/c-program-binary-search [Accessed 16 Jan. 2019].

Programmingsimplified.com. (2019). Linear search in C | Programming Simplified. [online] Available at: https://www.programmingsimplified.com/c/source-code/c-program-linear-search [Accessed 16 Jan. 2019].

microsoft (2019). What can you do with Visual Studio?. [online] microsoft. Available at: https://visualstudio.microsoft.com/vs/features/ [Accessed 16 Jan. 2019].

Programming and planning assignment help, Algorithms programming writing assignment help, Java programming help, Software and programming assignment help, Advanced programming homework help, Procedural programming Australia assignment help, Linear homework assignment help, Web Australia assignment help, Game programming writing help, Mobile device programming assignment

 

 

 

 

 



 DOWNLOAD SAMPLE ANSWER

Details

  • Number of views:
    34
  • PRICE :
    AU$ 66.00

Submit Works

Urgent Assignment Help

Our Top Experts


Karen Betty

Holding a PhD degree in Finance, Dr. John Adams is experienced in assisting students who are in dire need...

55 - Completed Orders


Daphne Lip

Canada, Toronto I have acquired my degree from Campion College at the University of Regina Occuption/Desi...

52 - Completed Orders


Mr Roberto Tuzii

Even since I was a student in Italy I had a passion for languages, in fact I love teaching Italian, and I...

102 - Completed Orders


Harsh Gupta

To work with an organization where I can optimally utilize my knowledge and skills for meeting challenges...

109 - Completed Orders


ARNAB BANERJEE

JOB OBJECTIVE Seeking entry level assignments in Marketing & Business Development with an organization...

202 - Completed Orders


KARAN BHANDARI

Current work profile Project manager- The Researchers Hub (2nd Jan 2016 to presently working) Researc...

20 - Completed Orders


Tan Kumar Ali

Sales Assistant, Mito Marina Assigned to the Stationery dept – assisted in merchandising, stock taking...

100 - Completed Orders


Wesenu Irko

Personal Profile Dedicated and highly experienced private chauffeur. High energy, hardworking, punctua...

200 - Completed Orders


Lizzy Darley

I'm Lizzy, full time education specialist in English, Essay Writing, Economics and Maths. Having Assi...

109 - Completed Orders


CRYSTAL

HSC PREPARATION I specialise in English coaching programs for HSC students. My personalised and results-...

202 - Completed Orders