Infosys Revision sheet
Infosys Revision sheet
Java
93. Overall, heap sort: as it has an edge for the space complexity. its
space complexity is O(1) whereas quick and merge sort requires the
94. Normalization.
95. Types of join
If there are some students who have competed few numbers of codes,
such as 1, 2, 3, 4 and so on. and also there are a few students who
have not done any code, i.e. no. of codes done is NOTA(none of the
above).
Now sort them on the basis of the number of codes done in such a case
100. If a unique key has a null constraint, can it be said as a primary key?