Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
Answer:
(a) Correlated.
Explanation:
Correlated subquery :These sub queries reference columns from outer table or uses values from outer query.These sub queries are processed atleast once for every row processed.So because of this reason correlated sub queries can be slow.Since the query in the question also uses value from the outer query so it is a correlated query.
Answer:
C. a registered Microsoft Account
1. Start up Open Office.Org.
2. Click on File >> New >> Labels.
3. In the label dialog box, click on the brand box. This will allow you to choose the type of paper that you use.
4. Select the type of document that you want. The usual standard is Avery, but feel free to explore and discover what you like.
5. Select if you want a single label, a document, and any other options. Some of the things you might want to do are:
- Create a variety of labels for folders or drawers
- Create a sheet of address labels
- Create decorative labels
6. Click New Document. Here, you see a sheet of blank labels.
7. Create the type of format/placement that you want for your labels. Once you are happy with it, copy it to the rest of the labels.
8. Fill your labels with necessary information.
9. Print them out.
