Java 程序代写

The Problem

The design team at AppsUnlimited has come up with the concept for a new app to help users find restaurants when they

traveling.

The prototype UI is given shown above. Basically the user enters two pieces of data, namely

1. How far they are willing to travel (e.g. 1.5 km), and

2. How much they are willing to spend, (e.g. $20).

The user can then do three types of search, namely

 All: Display all restaurants that match the user’s criteria.

 Best: Display those restaurants that match the user’s criteria and for which there is no other restaurants that are

both cheaper and closer.

 Ranked – Displays the same restaurants as Best button but the restaurants are ordered by rank. The rank of a

restaurant is the count of number of restaurants that match the constraints and are both farther and more

expensive.

The Data

This application is to be based on a Restaurants file which contains the following information for each restaurant:

o Name,

o Street address

o Average meal price,

Java程序代写： 实现Stack与Queue ADTs

CSci2110 – Problem Set 2

Change Log

• Jan 20th, 2015: Created
• Jan 31 Added helpful notes in blue

Design and implement your own reusable implementations of the stack and queue ADTs in Java. The purpose of this question simply is to help you get the feel for the design of reusable classes. Thus the actual data structure programming is fairly straightforward, and you have been given most of the structure of the code. Read the following description ofDouble Ended Queues.

A doubly-ended queue is often called a deque. The interface for a deque is the following (which is slightly different than the one given in the textbook):

public interface Deque { public int size(); public boolean isEmpty(); public void insertFirst(Object o); public void insertLast(Object o); public Object removeFirst() throws EmptyStructureException; public Object removeLast() throws EmptyStructureException; public Object firstElement() throws EmptyStructureException; public Object la