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

How many bits of data will be produced if voice is converted, If voice is c...

If voice is converted to digital form using PCM, how many bits of data will be produced in half a second? While voice is converted to digital by using PCM that is Pulse Code Mo

Define the analysis that determines the meaning of statement, Analysis whic...

Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as? Ans. The meaning of a statement when its grammatical structure b

What are the events used for page headers and footers, What are the events ...

What are the events used for page headers and footers? The events TOP-OF-PAGE and END-OF-PAGE are used for pager headers and footers.

State about the mainframe computer, Mainframe computer Mainframe comput...

Mainframe computer Mainframe computers are very large, often can fill an entire room. They can store a large amount of information, can execute many tasks at the same time, can

What are sequential algorithms, What are Sequential Algorithms? The cen...

What are Sequential Algorithms? The central assumption of the RAM model is that instructions are implemented one after another, one operation at a time. Accordingly, algorith

Explain in brief about compact disks, Explain in brief about Compact disks ...

Explain in brief about Compact disks (CD) These are an optical storage media that have basically taken over from floppy disk. Software is now generally supplied on a CD (in for

Data structure, program on multiple queue

program on multiple queue

What is block started by symbol, What is BSS(Block Started by Symbol)? ...

What is BSS(Block Started by Symbol)? A data showing at the machine level, that has initial values when a program begins and tells about how much space the kernel assigns for t

Instruction set design considerations, Some of the fundamental consideratio...

Some of the fundamental considerations for instruction set design includes selection of: A set of data-types (For example: integers, long integers, doubles, character strin

Methods for organising the associative memory, There are two methods for or...

There are two methods for organising the associative memory based on bit slices: Bit parallel organisation: In this organisation every bit slices which are not masked off,

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages