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

Syntax of $display and $strobe, Syntax of $display and $strobe - $disp...

Syntax of $display and $strobe - $display ("format_string", par_1, par_2, ... ); - $strobe ("format_string", par_1, par_2, ... ); - $monitor ("format_string", par_1, p

Explain in detail about the dynamic timing, Explain in detail about the Dyn...

Explain in detail about the Dynamic timing a. Design is simulated in full timing mode. b. Not all possibilities tested, as it is dependent on input test vectors. c. Simul

Binary floating-point number range, Q. Binary floating-point number range? ...

Q. Binary floating-point number range? Smallest Negative number Maximum mantissa and maximum exponent = - (1 -2 -24 ) × 2 127 Largest negative number

Learning abilities of perceptrons - ann, Learning Abilities of Perceptrons ...

Learning Abilities of Perceptrons - Artificial intelligence Computational learning theory is the study of what concepts specific learning schemes (representation and method) ca

Why do we need registers, Why do we need Registers? If t cpu is cycle...

Why do we need Registers? If t cpu is cycle time of CPU which is the time taken by CPU to execute a well-defined micro-operation employing registers and t mem is memory cycl

What is shadow mask, Q. What is Shadow Mask? Shadow Mask is a metal she...

Q. What is Shadow Mask? Shadow Mask is a metal sheet that has fine perforations (holes) in it and is situated a short distance before phosphor coated screen. The Phosphor dots

How to detect overflow condition, How to detect overflow condition An o...

How to detect overflow condition An overflow condition can be notice by observing the carry into the sign bit position and the carry out of sign bit position. If this carries a

Explain the methods of implementing interacting processes, Explain any two ...

Explain any two methods of implementing interacting processes. Two methods of implementing interacting process are given below: (i) Shared memory solution: In this scheme

Where the trunks lines are run between, Trunks are the lines that run betwe...

Trunks are the lines that run between (A) Subscribers and exchange (B) Switching system and power plant (C) Local area network (D) Switching stations Ans:

Explain about ip access, Explain about IP Access. IP access on the netw...

Explain about IP Access. IP access on the network by: • Intranets onto Virtual IP Networks and • Extranets onto Virtual IP Networks.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages