As a recent Albany BBA graduate, you have been directly recruited by the new CEO of ABC – a major multinational firm to assist with implement her vision. Before starting the internal reorganization, the CEO wants to understand the structure of the company and assigns you to the project. The IT person in charge is on long term leave but he emails you the EER diagram of the employees database along with the user id and password of the MySQL database of the company.NOTE: You only need the employees, salaries and dept_emp tables for the queries.Write a query to get the total salary paid to all employees since the start of the company. salariesdept empemp_no INT(11)1 emp_no INT(11)1 dept_no CHAR(4)salary INT(11)from_date DATEO to_date DATEfrom_date DATEKo to_date DATEIndexesIndexesPRIMARYPRIMARYemp_noemp_nodept_noemployeesemp_no INT(11)birth_date DATEfirst_name VARCHAR(14)departments# last_name VARCHAR(16) +gender ENUM('M', F')dept_no CHAR(4)dept_name VARCHAR(40)hire_date DATEIndexesIndexesPRIMARYdept_namePRIMARYdept_managertitles1 dept_no CHAR(4)1 emp_no INT(11)t emp_no INT(11)9 title VARCHAR(50)9 from_date DATEfrom_date DATEKo to_date DATEO to_date DATEIndexesIndexesPRIMARYPRIMARYemp_noemp_nodept_no Employees TableSalaries TableDept Emp Tableemp_no birth_datefirst_namelast_name gender hire_dateemp_no salary from_dateto_dateemp_nodept_no from_dateto_dateGeoraiBezalel6011762102100011953-09-02FacelloM1986-06-26100011986-06-261987-06-2610001d0051986-06-269999-01-011964-06-02SimmelBamfordKoblick10002F1985-11-21100011987-06-261988-06-25d007d004100021996-08-039999-01-01100031959-12-03PartoM1986-08-2810001660741988-06-251989-06-25100031995-12-039999-01-01100041954-05-01ChirstianM1986-12-0110001665961989-06-251990-06-2510004d0041986-12-019999-01-01100051955-01-21KvoichiMaliniakM1989-09-1210001669611990-06-251991-06-25do03d005100051989-09-129999-01-01100061953-04-20AnnekePreusia1989-06-0210001710461991-06-251992-06-24100061990-08-059999-01-01100071957-05-23TzvetanZielinskiF1989-02-1010001743331992-06-241993-06-2410007d081989-02-109999-01-01100081958-02-19 SanivaKalloufiM1994-09-1510001752861993-06-241994-06-2410008d0051998-03-112000-07-31100091952-04-19SumantPeacF1985-02-1810001759941994-06-241995-06-2410009do0061985-02-189999-01-01100101963-06-01DuanakaewPiveteau1989-08-2410001768841995-06-241996-06-2310010d0041996-11-242000-06-261001110012MarvPatricioEberhardt1953-11-07SluisF1990-01-2210001800131996-06-231997-06-2310010d0062000-06-269999-01-011960-10-04BridalandM1992-12-1810001810251997-06-231998-06-23do09do05d003100111990-01-221996-11-09100131963-06-07TerkkiM1985-10-2010001810971998-06-231999-06-239999-01-019999-01-01100121992-12-188491785112100141956-02-12BerniGeninM1987-03-11100011999-06-232000-06-22100131985-10-20Nooteboom MCappelletti100151959-08-19Guoxiang1987-07-02100012000-06-222001-06-2210014d0051993-12-299999-01-01100161961-05-02KazuhitoM1995-01-2710001850972001-06-222002-06-2210015d0081992-09-191993-08-22BouloucosPeha100171958-07-06CristinelF1993-08-0310001889582002-06-229999-01-0110016d0071998-02-119999-01-011954-06-19 Kazuhide1953-01-231987-04-031999-04-3010018F10002658281996-08-031997-08-0310017do011993-08-03 9999-01-0110019LillianHaddadiM10002659091997-08-031998-08-0310018d0041992-07-299999-01-01

The query in MySQL will be: mysql> select sum(salary) from employees e, salaries s, dept_emp d…

Answered: Write a query to get the total salary…

Engineering

Computer Science

Write a query to get the total salary paid to all employees since the start of the company.

Programming with Microsoft Visual Basic 2017

8th Edition

ISBN:9781337102124

Author:Diane Zak

Publisher:Diane Zak

Chapter8: Arrays

Section: Chapter Questions

Problem 12E

See similar textbooks

Similar questions

1. Create a book object which contains at least four different attributes (it should contains the name of the book and the publication date). Use the notation which is given below: Define Book which made of { .anAttribute .anotherAttribute } 2. Create an array of Books consists of 5 books. 3. Write an algorithm which is determining whether or not some book’s name in the array. 4. Write an algorithm which is determining the oldest book in the array.
Create an associative array $RegCourses, the Indices are the names of your registered courses last semester and the values are your grades.–Print out the contents with its indices in a vertical table–Based on $RegCourses, Calculate your GPA , the best grad and the worst one•Create an associative array $BatCompanions that hold the information of The battles of the companions (up to 4 battles). the Indices are the names of battles and the values are the names of the commanders.
Assign pizzasInStore's first element's numCalories with the value in pizzasInStore's second element's numCalories. #include <stdio.h>#include <string.h> typedef struct Pizza_struct { char pizzaName[75]; int numCalories;} Pizza; int main(void) { Pizza pizzasInStore[2]; scanf("%s", pizzasInStore[0].pizzaName); scanf("%d", &pizzasInStore[0].numCalories); scanf("%s", pizzasInStore[1].pizzaName); scanf("%d", &pizzasInStore[1].numCalories); /* Your code goes here */ printf("A %s slice contains %d calories.\n", pizzasInStore[0].pizzaName, pizzasInStore[0].numCalories); printf("A %s slice contains %d calories.\n", pizzasInStore[1].pizzaName, pizzasInStore[1].numCalories); return 0;} I tried 10 time but I cant solve it so please help me
Create an application to keep track of a list of students and their grades in a data structures course using a binary search tree.• Create a class called student that contains 2 data members: name and grade and then create a binary search tree of objects of this class. Make sure you validate the grade (A through F, and ? for in-progress grades).• Create a menu that has the following options:o Add a student -- add the student if he/she is not already in the classo Remove a student -- display “Not Found” error message if the student is not in the class.o Update the grade -- display “Not Found” error message if the student is not in the class.o Display class roster The program should use the binary tree definition. Please list all main, cpp, and hpp files. There must be a Student class, with Student.hpp and Student.cpp files. Do not use structures.
this is code #include <iostream> using namespace std; struct Node { int data; struct Node *next; }; struct Node* head = NULL; void insert(int new_data) { struct Node* new_node = (struct Node*) malloc(sizeof(struct Node)); new_node->data = new_data; new_node->next = head; head = new_node; } void display() { struct Node* ptr; ptr = head; while (ptr != NULL) { cout<< ptr->data <<" "; ptr = ptr->next; } } int main() { insert(3); insert(1); insert(7); insert(2); insert(9); cout<<"The linked list is: "; display(); return 0; } i want Re-implement it on doubly linked list take in account the set-position method and the operator overload and coy constructor and destructor ? in c++
AHPA #12: Movie Titles & Star Wars * * From a data file ("Lesson 14 - Movie Data"), read in data for Year, Total Gross, %± LY, Releases, Average, #1 Release for the years 1977 to 2019. * * I have decided that longer movie titles make more money. Add up the average income for each movie length and then print it out. * * * Tell me which movie length made the most money. * * Create an array that uses pointers to store each of the Star Wars movie titles. Once created, print out a of the movie titles in the array. *(use c) * #include <stdio.h> int main(void) { while (fgets (str, MAX_LEN, movieReleases ) != NULL ) { sscanf(str,"%d %f %d %d %[^\n]s",&year,&total,&releases,&average,&title); return 0;}
Jordan University of Science and TechnologyCS415 Contemporary Programming TechniquesMidterm Exam – Second semester 2021Name: ID: Section:Important note: your code must compile correctly and run without errors.Otherwise your code will get the grade zero.Question 1: Implement a java class called ParsingCustomerRecords that has thefollowing data members and functions:ParsingCustomerRecods- customerRecords: array of strings- result: string variable- recordsNumber: int variable-fileName: string variable+ Constructor(String filename, int recordsNumber)+ void Reader()+ void Executor()+ void showResult()+ String toString()All of the data members are private, and all of the methods are public.Constructor has two parameters which are (1) the file name in which Customers’ recordsare stored, and (2) the number of the records in the file. The constructor functionality is toassign suitable initial values to the fileName and recordsNumber data members. Theconstructor also should instantiate the…
Computer Science Part 2: Client Program with ArrayList Create a second client program. This program will contain an ArrayList of StudentGrades objects. The program will perform the following tasks: Create an instance of an ArrayList that will store three StudentGrades objects. Each element in the ArrayList represents student grades for a test (assessment). This means that each StudentGrades object stored by the ArrayList element represents the grades achieved by students for a single test. Prompt the user for the number of students in the class. The prompt text is: Enter the number of students in the course: [Keyboard Input] Add three new StudentGrades objects to the ArrayList. The StudentGrades objects should be populated with random values from 0 to 100. Use the enhanced for loop to print each of the StudentGrades objects to the console. Print a line containing the following text: “LAST ELEMENT BEFORE REMOVE:”. Print the value of the final element in the ArrayList under the heading.…
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode *leftPtr; int data; struct treeNode *rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr *treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if (*treePtr != NULL) { (*treePtr)->data = value;…
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode* leftPtr; int data; struct treeNode* rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode* TreeNodePtr; void insertNode(TreeNodePtr* treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr* treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if…
# Create Custom Transformer Create a custom transformer, just as we did in the lecture video entitled "Custom Transformers", that performs two computations: 1. Adds an attribute to the end of the numerical data (i.e. new last column) that is equal to $\frac{x_1^3}{x_5}$ for each observation. In other words, for each instance, you will cube the $x_1$ column and then divide by the $x_5$ column. 2. Drops the entire $x_4$ feature column if the passed function argument `drop_x4` is `True` and doesn't drop the column if `drop_x4` is `False`. (See further instructions below.) You must name your custom transformer class `Assignment4Transformer`. Your class should include an input parameter called `drop_x4` with a default value of `True` that deletes the $x_4$ feature column when its value is `True`, but preserves the $x_4$ feature column when you pass a value of `False`. This transformer will be used in a pipeline. In that pipeline, an imputer will be run *before* this transformer. Keep…
#ifndef lab5ExF_h #define lab5ExF_h typedef struct point { char label[10]; double x ; // x coordinate for point in a Cartesian coordinate system double y; // y coordinate for point in a Cartesian coordinate system double z; // z coordinate for point in a Cartesian coordinate system }Point; void reverse (Point *a, int n); /* REQUIRES: Elements a[0] ... a[n-2], a[n-1] exists. * PROMISES: places the existing Point objects in array a, in reverse order. * The new a[0] value is the old a[n-1] value, the new a[1] is the * old a[n-2], etc. */ int search(const Point* struct_array, const char* target, int n); /* REQUIRES: Elements struct-array[0] ... struct_array[n-2], struct_array[n-1] * exists. target points to string to be searched for. * PROMISES: returns the index of the element in the array that contains an * instance of point with a matching label. Otherwise, if there is * no point in the array that its label matches the target-label, * it should return -1. * If there are more than…