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

Logic-based expert systems - , Logic-based Expert Systems - Artificial inte...

Logic-based Expert Systems - Artificial intelligence: Expert systems are agents which are programmed to make decisions about real world situations. They are put together by uti

Push and pop, Suupose a stack-oriented processor that haves the stack opera...

Suupose a stack-oriented processor that haves the stack operations PUSH and POP. Arithmetic operations automatically involve the top one or two stack elements. Starting with an

Explain program source code, Q. Explain Program Source Code? Program S...

Q. Explain Program Source Code? Program Source Code Every assembly language statement appears as: {identifier} Keyword {{parameter},} {;comment}. Element of a

Using binary search, A sorted file having 16 items. Using binary search, th...

A sorted file having 16 items. Using binary search, the maximum number of comparisons to find for an item in this file is The maximum number of comparison is 4

Types of bus - computer architecture, Types of Bus: Synchronous Bus ...

Types of Bus: Synchronous Bus All devices gain timing information from a common clock line. Each of these intervals constitutes a bus cycle at the time duration w

Why pointer variable to a function as an argument, Why pointer variable som...

Why pointer variable sometimes desirable to pass a pointer to a function as an argument? Frequently, a called function needs to make changes to objects declared in the calling

What is the standard template library (stl), A library of container templat...

A library of container templates approved by the ANSI committee for inclusion in the standard C++ specification. A programmer who then launches into a discussion of the generic

Find blocking probably in 100-line strowger switching system, Calculate the...

Calculate the blocking probably Pb in 100 line strowger switching system where 10 calls are in progress and 11th one arrives, probably that there is a call in a given decade = 1/10

Illustrate control and timing signals, Q. Illustrate control and timing sig...

Q. Illustrate control and timing signals? The requirement of I/O from different I/O devices by processor is quite unpredictable. In fact it relies on I/O needs of particular pr

Avoiding over fitting in decision trees, A v o iding Over fitting - Arti...

A v o iding Over fitting - Artificial intelligence As we discussed in the last lecture, over fitting is a normal problem in machine learning. Decision trees suffe

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages