Example of asymptotic notations, Computer Engineering

Assignment Help:

Q. Example of asymptotic notations?

The function f (n) belongs to the set  (g(n)) if there exists positive constants c such that for satisfactorily large values of n we have 0<= c*g(n) <=f(n). In another words,

  O(g(n)) ={ 0<= c*g(n) <=f(n) for all n >= no }.    

Assume we have a function f (n) = 4n2 + n then order of function is O(n2). The asymptotic notations give information about the upper and lower bounds on complexity of an algorithm with help of O and ? notations. E.g. in the sorting algorithm the upper bound is O (n ln n) and lower bound is ? (n ln n). But problems such as matrix multiplication have complexities such as O (n3) to O (n2.38).

Algorithms that have similar lower and upper bounds are called optimal algorithms. So a few sorting algorithms are optimal whereas matrix multiplication based algorithms are not.


Related Discussions:- Example of asymptotic notations

What are the benefits of using e-commerce, What are the benefits of using e...

What are the benefits of using e-commerce? Basic Benefits of E-Commerce The main benefits are enhancing sales and reducing costs. The other advantages are as follows: 1.

What are addressing modes, What are Addressing Modes Many of instructio...

What are Addressing Modes Many of instructions that a computer actually executes during running of a program concern movement of data to and from memory. It is not possible sim

Expalin the history of parallel computers, Expalin the History Of Parallel ...

Expalin the History Of Parallel Computers The researches with and implementations of use of the parallelism started long back in the 1950's by IBM Corporation. The IBM STRETCH

Programming with parallel virtual machine, Q. Programming with parallel vir...

Q. Programming with parallel virtual machine? The general method for writing a program with PVM is like this:  A user writes one or more sequential programs in C++, C or FOR

Explain both absolute addressing and implied addressing, Absolute addressin...

Absolute addressing and  Implied addressing A fixed address is specified and also called as direct addressing. The location of data is implied by instruction itself, so no

Connectives - first-order logic , Connectives - first-order logic: We ...

Connectives - first-order logic: We can string predicates all together in a sentence by using connectives into the same way to conduct that we did for propositional logic. We

Branch (control) hazards in computer architecture, Branch (control) hazards...

Branch (control) hazards in computer architecture : Branching hazards (also called control hazards) take place when the processor is told to branch -for example, if a defin

What is a table pool, What is a table pool? A table pool (or pool) is ...

What is a table pool? A table pool (or pool) is used to join several logical tables in the ABAP/4 Dictionary.  The definition of a pool having of at least two key fields and a

Efficiency of vector processing over scalar processing, Efficiency of Vecto...

Efficiency of Vector Processing over Scalar Processing As we know a serial computer processes single scalar operands at a time. So if we have to process a vector of length 'n'

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