Time complexity in the worst case, Computer Engineering

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.



Posted Date: 3/22/2013 3:21:31 AM | Location : United States

Related Discussions:- Time complexity in the worst case, Assignment Help, Ask Question on Time complexity in the worst case, Get Answer, Expert's Help, Time complexity in the worst case Discussions

Write discussion on Time complexity in the worst case
Your posts are moderated
Related Questions
Question 1: Describe the five maturity levels of KM that an organization faces when adopting the Frid's KM framework. Question 2: (a) Describe three major issues that

Here are some common development milestones that  you should aim for: 1. Send a packet over. Send an acknowledgement back. 2. Have checksum algorithm executed 3. Ability t

How is communication between computers established in Internet. What characteristics need to be defined in a communication protocol? Explain the physical and logical paths in a com

Are there any special rules about inlining? Yes, there are some rules about inlining - a.) Any source files which used inline function should contain function's definition.

Basics of Caches: "The caches are situated on basis of blocks, the shortest amount of data which may be copied between 2 adjacent levels at a time. "If requested data by th

Q. What are the basic types of Transmission technologies, basis on which computer networks will be categorized? Ans: Broadly there are two kinds of transmission technology:

an asyncronous sequential circuit is described by the the exitatio function and the output function y=x1x2''+(x1=x2'')y output function z=y a)draw the logic diagram of the circuit.

Q. Explain Micro-operations performed by CPU? The micro-operations performed by CPU can be categorized as:    Micro-operations for data transfer from register-memory, re

Convert the given S-R flipflop to a D-flip flop. Ans: The Truth Table for S-R Flip-Flop is illustrated in Fig.(a) and truth table of D Flip-Flop is illustrated in Fig.(b)