1- every employee’s salary lies within a job grade. Use your HR ERD to show the employee ID, first and last names, salary, job name, and job grade 2- displaying employees and their managers, along with the department names in which they belong. Display the employee ID, first and last name, manager ID and department name. The output must be arranged so that departments are shown together before another one is displayed.
3- Write suitable SQL statement to show this scenario: The HR department needs you to produce a report on job grades and salaries. Write a query that will display the names, job name, department name, salary, and grade for all employees.
4- subquery that reports the last name, department ID, and job ID of all employees whose department location ID is 1700 or 1800.​

What is a distinguishing feature of today’s graphic application software?) graphic applications are used today on a variety of devices, including touch-screen kiosks and mobile phones.

Write a full class definition for a class named player , and containing the following members: a data member name of type string .a data member score of type int .a member function called setname that accepts a parameter and assigns it to name . the function returns no value. a member function called setscore that accepts a parameter and assigns it to score . the function returns no value. a member function called getname that accepts no parameters and returns the value of name .a member function called getscore that accepts no parameters and returns the value of score .this is what i have, aparently this is wrong: class player{private: string name; int score; public: void player: : setname (string n){name =n; }void player: : setscore (int s){score = s; }string player: : getname (){return name; }int player: : getscore (){return score; }};

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?