Problem Given the following database tables Employee (SSN, name, location) Assigned (SSN, project_name, duration) Project (project_name, category, budget, location) Write SQL statements to find the following: Project names with a budget smaller than the average budget of projects in a given category let us say “Test Category” Employees who are assigned to all projects with
Problem Write a Java program to find character counts in a string consisting from capital letters (A to Z) only. The program must not use nested loops. Hash tables that are built in to the language must not be used as well. For example if the input string is “CACBACDDDD” the output of the program
Find word count using perl Write a perl program that prints word count in file. For example if the input file contains the following word occurrences “Santa Clara is located in Santa Clara county” the program should print something like: Santa: 2 Clara: 2 is: 1 located: 1 in: 1 county: 1 Word count perl
Two arrays differences Given two integer arrays A and B of the same size each having no duplicate values. Write an equality function that returns true if A and B are equivalent. The arrays are equivalent if they contain the same content regardless of order. The function should return false if the arrays are not
Problem Write a Java class to implement a stack data structure using an array for storage. The stack must support pop and push operations. Java stack implementation A stack is a LIFO (last in first out) data structure. A push operation adds an element to the top of the stack. On the other hand a
Array recursive sum problem Given an array of N integers. Write a recursive function to calculate the sum of all elements in the array. Recursive sum algorithm The sum of N elements in a list is equivalent to the sum of one element of the array and the rest N-1 elements Code The following is
Recursive function to find max in array Write a recursive function to find the maximum value element in an Array of size N. Recursive definition of maximum In order to solve this problem recursively we need a stopping condition to break the chain of recursive calls. We also need to represent the solution for an array
