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

Find cross points and primary no. in 3-tage satge switching, A three stage ...

A three stage switching structure supports 100 inlets and 400 outlets. Find the number of cross points, and the number of primary and secondary switches used in the design. We

Dynamic configuration of parallel virtual machine, Q. Dynamic Configuration...

Q. Dynamic Configuration of parallel virtual machine? int pvm_addhosts( char **hosts, int nhost, int *infos ) Add hosts to virtual machine. hosts is an arra

Final year project, i want to make final year project in wireless.please he...

i want to make final year project in wireless.please help me to decide the topic???????

Why is c standard library needed, Why is C standard library needed?  C ...

Why is C standard library needed?  C Standard Library: C would have been a tough programming language in absence of the standard library. The standard library in C contains

Examples of input, (i)  Input a single ASCII character into BL register wit...

(i)  Input a single ASCII character into BL register without echo on screen  CODE SEGMENT  MOV AH, 08H;         Function 08H  INT 21H          ;         the character inpu

Explain FIFO page replacement algorithm, Explain FIFO Page replacement algo...

Explain FIFO Page replacement algorithm. FIFO policy: This policy only removes pages in the order they entered in the main memory. By using this policy we simply eliminate a

Avl tree rotation and b tree construction in data structure, Elements are g...

Elements are given 3,14,7,1,8,5,11,17,,6,23,12,20,26,4,16,18,24,25,19 We will construct b tree and avl tree And after that delete some integers

Explain random-access semiconductor memories, Q. Explain Random-access Sem...

Q. Explain Random-access Semiconductor Memories Q. What is Basic memory cell? Explain Two Dimension Memory Organization with diagram.

Advantages and disadvantage of message passage programming, Q. Advantages a...

Q. Advantages and Disadvantage of Message Passage Programming? Advantages of Message Passage Programming     Portable It is less error prone Offers excellent

Calculate period of congestion in a particular exchange, In a particular ex...

In a particular exchange during busy hour 1200 calls were offered to a group of trunks, during this time 6 calls were lost. The average call duration being 3 minutes Calculate

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