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

What are the characteristics of the e-cash, What are the characteristics of...

What are the characteristics of the E-Cash? These kinds of payments, turning the Internet within a transaction oriented forum, need mediums which are easy and cheap (through a

For what CIDR stands, CIDR stands for? CIDR stands here for Classless I...

CIDR stands for? CIDR stands here for Classless Inter Domain Routing.

Determine about the security methods, Determine about the Security methods ...

Determine about the Security methods Security methods also protect information from accidental or intentional modification, manipulation or destruction. Most security experts o

Accessing a cache - computer architecture, Accessing a Cache: Direct ...

Accessing a Cache: Direct mapping: (Block address) modulo (Number of cache block in the cache) The valid bit indicate whether an entry contain a valid address.

What is an identification method, An identification method notifies Robot h...

An identification method notifies Robot how to recognize the values to compare during record and playback.

Perform multiplication with showing content of accumulator, Perform multipl...

Perform multiplication with showing the contents of accumulator, B register and Y register during each step. (Accumulator, B, Y are 4-bit registers) B=06 Y=02

What is a javabean, JavaBeans are reusable software components written in t...

JavaBeans are reusable software components written in the Java programming language, designed to be influenced visually by a software development environment, like JBuilder or Visu

Which is valid syntax of the fork and join primitive, Which is valid syntax...

Which is valid syntax of the Fork and Join Primitive? Ans. A valid syntax of the Fork and Join Primitive is as given below: Fork Join

How do you find out if a linked-list has an end, By 2 pointers you can find...

By 2 pointers you can find it. One of them goes 2 nodes each time. The second one goes at 1 node each time. If there is a cycle, the one that goes 2 nodes every time will eventuall

State in brief about the proxy server, State in brief about the proxy serve...

State in brief about the proxy server A proxy server also helps a lot since it hides the real IP addresses of users requesting resources outside the firewall. Finally, the

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages