1. Review the ER diagram provided as a solution to HW1 and the SQL DDL provided as a solution to HW2- review them carefully! List any business rules called out in HW1's description that are not captured in this current SQL DDL. For each, indicate whether it is (i) reflected in the ER diagram but not in the SQL DDL or (ii) missing in both the ER diagram and the SQL DDL. An example answer in your list might be "The rule that a User must not be a cat is missing in both the ER diagram and the SQL DDL." (That is, if the initial problem statement had said that.)

. Answer the following questions: (12 Points) a) What is a priority queue?A priority queue takes item's priority into account. When items in the queue are accessed, the item with the highest priority is accessed first. b) What is a binary search tree? c) What is a heap?

Given a graph G=(V, E), what is its adjacent matrix and what is its incident matrix? (8Points)

Assume that an array has n elements. Prove that the complexity of the binary search isO(log. n). (10 Points)

Complete the integer stack class defined below: (10 Points)

1. Assume that f(n) = 2n² + 3n +1. Figure out M, N>0, when n>N, |f(n)|<M|n²l, i.e.f(n)=O(n³). (10 Points)

3. Complete the integer queue class defined below: (12 Points)

QUESTION :- express OX5ABC8 in double precision binary floating point.

The following relative-frequency polygon was constructed for the examination scores for a class of 25 students. Construct the frequency-distribution table for the students 'for a class o1.scores.

:- Explain whether it is possible to have concurrency but no parallelism.