1. Which of the following sorting algorithm is not in place?
a. merge sort
b. Bubble sort
c. selection sort
d. insertion sort
1. The sorting technique where array to be sorted is partitioned again and again in such a way that all elements less than or equal to partitioning element appear before it and those which are greater appear after it, is called
a. insertion sort
b. merge sort
c. selection sort
d. Quicksort
Consider two entity sets A and B that both have the attribute X (among others whose
names are not relevant to this question).
a. If the two Xs are completely unrelated, how should the design be improved?
b. If the two Xs represent the same property and it is one that applies both to A and to
B, how should the design be improved? Consider three subcases:
X is the primary key for A but not B
X is the primary key for both A and B
X is not the primary key for A nor for B
Let us consider the two concurrent transaction A and B which is accessing the data at the same time. At the point T, the conflict has occurred between the two concurrent transactions. By considering this scenario as example, explain-
a. Write Read conflict
b. Read Write conflict
c. Lost update problem (WW)