Time complexity in the worst case, Computer Engineering

Assignment Help:

Speicified the following piece of code:

int i = 1;

int j = 4;

while (i<(n*n)&& j<(n*n*n*n))

{

if (i%3 == 0) i+=3;

else i+=4;

if (j%2 == 0) j*=4;

else j*=2;

}

Verify its time complexity in the worst case. You must display your computations.

Related Discussions:- Time complexity in the worst case

Find out data changing from special code to temporal code, Data can be chan...

Data can be changed from special code to temporal code by using ? Ans. By using Shift Registers data can be changed from special code to temporal code. A Register wherein data ge

Discuss briefly subscriber loop system, Discuss briefly subscriber loop sys...

Discuss briefly subscriber loop system. Subscriber Loop System: Every subscriber in a telephone network is connected usually to the nearest switching office using a dedicated

What are the basic functions of database utility, What are the basic functi...

What are the basic functions of Database utility? The basic features of database utility are: Make database objects. Remove database objects. Adjust database obj

Electronic typewriter , Electronic typewriter : An electronic typewriter h...

Electronic typewriter : An electronic typewriter has a 'memory' or 'electronic brain' which enables it to recall the whole document at a time and type it automatically at the pres

Returns information about present virtual machine, Q. Returns information a...

Q. Returns information about present virtual machine? int pvm_parent( void ) Returns the tid of process which spawned the calling process. int pvm_tidtohost(

Explain resource request and allocation graph (rrag), Explain Resource requ...

Explain Resource request and allocation graph (RRAG) Deadlocks can be explained by a directed bipartite graph known as a Resource-Request-Allocation graph (RRAG).A graph G = (V

What are the advantages of batch processing, What are the advantages of bat...

What are the advantages of batch processing This has the advantage which jobs can be processed when computer resources are less busy (for example during the evening or at night

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)

Explain about the view selection problem, Often calculating all the data is...

Often calculating all the data is not possible by aggregations for this reason some of the difficult data problems are solved. In order to verify which data should be solved and me

Why network layer is used, Network Layer is used for (A) Breaking up ...

Network Layer is used for (A) Breaking up the data in frames for transmission (B) Deal with Error correction (C) Automatic Recovery of Procedure (D) Physica

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages