Computation step in time complexity of an algorithm, Computer Engineering

Assignment Help:

Q. Computation step in time complexity of an algorithm?

So First in the computation step the local processor executes an arithmetic and logic operation. Afterwards the several processors communicate with one another for exchanging messages and/or data. Therefore the time complexity can be computed on the grounds of communication cost and computational cost involved.

Time complexity of an algorithm fluctuates depending on the instance of input for a provided problem. For illustration the already sorted list (10, 17, 19, 21, 22, 33) will take less amount of time than reverse order of list (33, 22, 21, 19, 17, 10). The time complexity of algorithm has been classified into three forms which are.

i) Best Case Complexity;
ii) Average Case Complexity; and
iii) Worst Case Complexity.

The best case complexity is the minimum amount of time needed by algorithm for a provided input. The average case complexity is average running time needed by algorithm for a provided input. As in the same manner the worst case complexity is able to be defined as maximum amount of time needed by the algorithm for a provided input.

So the major factors occupied for analysing time complexity relies on the algorithm, specific set of inputs and parallel computer model. Mainly the size of input is a function of time complexity of algorithm.


Related Discussions:- Computation step in time complexity of an algorithm

Determine the complete or gate and and gate decoder, Q. Determine the comp...

Q. Determine the complete OR gate and AND gate decoder count for an IC memory with 4096 words of 1 bit each, using the Linear select memory organization and Two dimensional Memory

Diffrence between RISC and CISC architecture, Q. Diffrence between RISC and...

Q. Diffrence between RISC and CISC architecture? CISCs provide better support for high-level languages since they include high-level language constructs such as CASE, CALL etc

Make a generalize program to performs r-ary subtraction, Q. Make a genera...

Q. Make a generalize program that performs r-ary subtraction on two numbers using (r-1)'s and r's complement? Use input and output files.

Salient points about addressing mode, Salient points about addressing mode ...

Salient points about addressing mode are:  This addressing mode is employed to initialise value of a variable. Benefit of this mode is that no extra memory accesses are

What is server in sap terminology, What is Server in SAP terminology? ...

What is Server in SAP terminology? A component can having of one process or a group and is then known as the server for the respective service.

Define relocatable programs, Relocatable programs? Ans. Relocatable pro...

Relocatable programs? Ans. Relocatable programs can be loaded almost anywhere inside the memory.

Environments -artificial intelligence, Environments: We have seen that...

Environments: We have seen that an agents intelligent should take into account certain information when it choose a rational action, including information from its sensors, in

Control dependence, Control Dependence Segments or Instructions in a pr...

Control Dependence Segments or Instructions in a program may obtain control structures. Thus, dependency between the statements can also be in control structures. But the order

How dreamweaver work in layout view, Q. How Dreamweaver Work in Layout View...

Q. How Dreamweaver Work in Layout View? Dreamweaver has two visual design views-Standard view and Layout view. You will start by working in Layout view, which allows you to dra

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