Explain various steps for analysing an algorithm, Computer Engineering

Assignment Help:

Explain various steps for analysing an algorithm. 

The several steps involved in analysis of an algorithm are:

1. For any algorithm, the first step should be to show that it always returns the desired output for all legal examples of the problem.

2. Second step to examine an algorithm is to verify the amount of resources such as time and storage necessary to implement it. Usually the efficiency or complexity of an algorithm is stated as a function relating the input length to the number of steps (time complexity) or storage locations (space complexity).

 


Related Discussions:- Explain various steps for analysing an algorithm

Length property of array , DEscribe a console application to show all the a...

DEscribe a console application to show all the arguments passed tocommand line whereas running the application. The user can pass anynumber of arguments that should be shown. Use l

State the number of definitions of firewall, State the number of definition...

State the number of definitions of firewall Though there exist a number of definitions of firewall, in simplest terms it can be defined as "a mechanism used to protect a truste

Autonomous rational an agents, Autonomous Rational an Agents: In many ...

Autonomous Rational an Agents: In many cases, it is inaccurate to talk about a single program or a single robot, as the multi-purpose and multi-tasking system of hardware and

Give example of bus and memory transfer, Give example of bus and memory tra...

Give example of bus and memory transfer For example, the read operation for transfer of a memory unit M from address register AR to another data register DR can be illustrated

Implement and - or- not gates using bit wise operator, Q. Develop  a menu d...

Q. Develop  a menu driven program to implement AND, OR, NOT gates using and without using  Bit wise operator. The menu  should  be  as follows: I.  Using Bit Wise operator I

Show the connection between different networks, Q. Show the Connection betw...

Q. Show the Connection between different networks? The connection between different stages is made in following manner:  all outputs of 1 st crossbar switch of first stage a

is risc always fast, It is fast because it has got separate program and da...

It is fast because it has got separate program and data memory(highly pipelined architecture)

Determine no.of processes to avoid race condition, To avoid race condition,...

To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is The maximum number of processes is one to ignore race conditi

Creating a function, I''m suppose to create a function called calc_rectang_...

I''m suppose to create a function called calc_rectang_area(height, width),that takes two parameters: the height and width of the rectangular and return the area of the rectangular.

Determine about the memory stack, Memory Stack Stack could exist as a s...

Memory Stack Stack could exist as a stand-alone unit or could be executed in a random-access memory attached to the CPU. The implementation of a stack in a CPU is done by assig

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd