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
- 1685 Views
- St. Pauls University, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What are the disadvantages of java sockets?
What is jpa entitymanager?
Are jvm’s platform independent?
In a barber shop there are 2 doors. customer come in 1 door, leave in other. minimum # of chairs. barber spend his life in cutting. always barber can cut 1 customer. few chairs in the shop. if barber busy customer waits, if chairs full, customer leave. if no customer, barber sleeps. treat barber and customer as 2 threads. you can use Semaphore class with arrive and depart and count as parameter.
What is reflection in java?
What is web container in java?
Why struts framework is used in java?
What do you understand by a variable?
what is transient variable?
Why we use beans in java?
write a code in jsp to swap two numbers?
What is meant by annotations in java?
Java J2EE 
