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?

2075

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.

3822

Explain issues of old java date api?

955

What is the java virtual machine (jvm)?

1016

Is jdk an ide?

869

What is a stream in programming?

802

What is lambda expressions action func and predicate?

898

Can a dead thread be started again?

1043

What is a java singleton?

875

What is gpt and gpc? : java security

955

How do I install jdk?

823

Explain main thread under thread class execution?

844

How do I open the java console in windows 10?

979

What is a container in java?

842

What is a java proxy?

899