Java | JSP | JSF Answers

how can i call a class in another class and how to add in it in the other class

Assuming I have 5 bank branches. I wanna make a withdraw function on all the branches. A scenario, if I make withdrawal from branch A but my account info is at branch B, the info has to be passed to branch B to process and the result would be returned to branch A once it is completed. I have to use UDP to do it.

Where is the error in the array declaration int [5] numbers;
A. there is no error
B. The square brackets should be empty
C. There should be no space between int and [
D. It should be int numbers[5];

Write a method with a void return value that inverts all the elements of a two-dimensional array of booleans (true becomes false and false becomes true).

Write a value-returning method that returns the number of columns with n elements in a two-dimensional array of chars, where n is a parameter of the method. Include code to test your method.

Where is the error in this code sequence?
int [ ][ ] a = { { 1, 2 },
{ 10.1, 10.2 } };

develop program that simulates CPU Scheduler algorithms FCFS SJF Priority

Write a program in a class OnDemandMovieHits that computes the cost of each movie sold On Demand. There are 7 movies. You may come up with the list of the 7 movies. Also, come up with a unique cost for each movie per day. The higher the popularity, the more expensive the movie needs to be. Create an array of strings that holds the names of the movies. Create another array that holds the cost of each corresponding movie. Your program should allow the user to select from a menu list of movies and the number of days the customer wants to keep the movie available to them. Locate the movie in the name array and use that index to find the cost per day in the cost array. Compute and print the total cost of sale.

The heap data structure is very useful for implementing priority queues. This is a data structure for maintaining a set S of elements, each with an associated value or key.It supports the following priority queue operations • Insert(S, x): inserts the element x into set S • Maximum(S): returns the element of S with the maximum key • ExtractMax(S): removes and returns the element of S with the
maximum key