In the country of WeirdLand, there is only one barber shop. In the shop there are 3
barbers, Alpha, Beta and Gamma, who are not always efficient as employees. All the customers are seated in a waiting area, each customer has a card which has a unique integral ID. For calling next person from the waiting area each barber has his own weird way:
Alpha: He will call either the person with least ID from the waiting area of the one with max ID. Min or Max is decided randomly by him
Beta: He will call the kth smallest ID, (Kth ID when all IDs are arranged in ascending order). K is chosen randomly(1 <= K <= Total persons)
Gamma: He will always choose the median ID. If there are ‘n’ people in the waiting area, the median will be defined as (n+1)/2 th ID when all of them are arranged in ascending order. (For both odd and even ‘n’ )
Your task is to design a data structure which should support the query of each of the three
barbers. The data structure should be highly efficient.
hoping for answer im so glad this website is make.i shared it on my friend
a. The length and width, in inches, of the picture.
b. The type of the frame.
c. Customer’s choice of color to color the frame.
d. If the user wants to add the crowns, then the number of crowns.
How do we provide security to RMI classes? Write a program to implement Simple Student database application using RMI. Remote client consist of GUI for performing different database operations (For ex. Insert, delete, update) and retrieving data through RMI.
Regular service: $10.00 plus first 50 min. are free. Charges for over 50 min. are $0.20 per minPrem. service: $25.00 plus: calls made from 6:00 a.m. to 6:00 p.m., the first 75 min. are free; charges for over 75 minutes are $0.10 per mincalls made from 6:00 p.m. to 6:00 a.m., the first 100 minutes are free; charges for over 100 minutes are $0.05 per minprogram should prompt the user to enter an account num, a service code (type char), and the number of minutes the service was used. A service code of r or R means regular service; a service code of p means prem service. Treat any other character as an error. Your program should output the account number, type of service, number of min. the telephone service was used, and the amount due from the user. For the premium service, the customer may be using the service during the day and the night., to calculate the bill, you must ask the user to input the number of min the service was used during the day and the number of minutes the service was used during the night.
Write a program that calculates the number of characters in a line and the number of lines that can be printed on a paper based on the following input from the user:
a. The length and width, in inches, of the paper.
b. The top, bottom, left, and right margins.
c. The point size of a line.
d. If the lines are double-spaced, then double the point size of each character.
Suppose that overSpeed and fine are double variables. Assign the value to fine as follows: If 0 < overSpeed <= 5, the value assigned to fine is $20.00; if 5 < overSpeed <= 10, the value assigned to fine is $75.00; if 10 < overSpeed <= 15, the value assigned to fine is $150.00; if overSpeed > 15, the value assigned to fine is $150.00 plus $20.00 per mile over 15.
There is a binary tree given to you. In which each of the node represents the student in the class.
You are playing a game in which you need to team up with one of student in class. Team can be
formed in such a way that in a team both of the students can’t have same parent in tree and should
be at the same level in binary tree.
Input: we have given you some pair of students you need to find that is the team valid or not.
Output: ‘Yes’ if the team is valid or ‘No’ if the team is invalid.
(a) Optimal solution of O(n) for checking the team validity.
(b) How many tree traversal is required for the solution of the above problem.
Marking Scheme: Total 15 marks-> 10 for part (a)( Algorithm explanation + Pseudo-code +
runtime and data structure used)+ 5 for part (b)(explanation is required)
Suppose there is a list s1->s2->s3->.........->sn-1
->sn. given to you. You need to modify this list in
such a way that it will be s1->sn
->s2->sn-1
->s3->sn-2.......
Note: algorithm should be inplace without modifying the values of the nodes.
Marking Scheme: Total 10 marks ( Algorithm explanation + Pseudo-code + runtime and data
structure used)