For each of the following program segments,give a big zero
analysis for the running time
1.For (i=0;i<m;i++)

{

//
}
2.For (j=0;j<i;j++)


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Java Related AllOther Interview Questions

What is singleton pattern in java?

0 Answers  


Explain main thread under thread class execution?

0 Answers  


I want to control database connections in my program and want that only one thread should be able to make database connection at a time. Define how can I implement this logic?

0 Answers  


What is difference between map and flatmap in java 8?

0 Answers  


What is cache in java?

0 Answers  






what diff bw constructor method & method

4 Answers   CTS,


program A and B are analysed and found to have worst case running time greater than 150NlogN and N*N respectively. which program has the better guarantee after the running time for the large values of N(N>10000)? which program has the better guarantee for the running time of small program N (N<100)? which program will run faster on average for N=1000?

0 Answers   St. Pauls University,


If you’re overriding the method equals() of an object, which other method you might also consider?

0 Answers  


there are 67 seats in train . there are only 5 seats in a row and in last row there are only 2 seats. One person can reseve only 5 seat at a time. If person reserving seat , the care is atken that he may get all in row. if seats are not available in row then the arrangement is so that person group get nearby seats. the following class is given public class seat { char name; int seat; boolean isSeatempty } 1.Draw require class digram and object diagram. 2.Write function seatallot(int noofperson) to allocate seat with seat nuber printed for the each name.

0 Answers   Sapient,


What is the difference between lambdas and delegates?

0 Answers  


How do I find jre version?

0 Answers  


is hibernate a technology or framework?

4 Answers  


Categories