Search & Filtering
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
a. Serial Schedule ( T1 followed by T2)
b. Serial Schedule ( T2 followed by T1)
C. List out the advantages and limitations of serial scheduling in transaction processing
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)
(9) Display in a pretty format the names of drivers who performed no trips so far.
(10) Display in a pretty format names of drivers who started at least on trip in
Wollongong.
Need help for part 9 and 10
we type a collection of relational algebra queries, and get the following results.
A B C D E
I am the manager of a training company that provides instructor-led courses in management techniques. We teach courses, each of which has a code, a name, and a fee. Introduction to UNIX and C Programming are two of our more popular courses.
Courses vary in length from one to four days. Paul Rogers and Maria Gonzales are two of our best teachers. We need each instructor’s name and phone number. The students can take several
courses over time, and many do this. Jamie Brown from AT&T took every course we offer!
We like to have each student’s name and phone number.
