Results 1 to 4 of 4

Thread: Queues

  1. #1
    A.M.S is offline Member
    Join Date
    Dec 2008
    Posts
    17
    Rep Power
    0

    Default Queues

    Hi everybody,

    I'm required to get my project done, I just didn't get it :S
    I'm asking to help me to understand it, I don't want the solution !!
    just explain to me what should i do ?

    this is the project file :
    http : // www .2shared.com/file/10160935/8dda382d/P1_online. html

    Thanks :)

  2. #2
    coltragon is offline Senior Member
    Join Date
    Dec 2009
    Posts
    104
    Rep Power
    0

    Default

    could you please post your code, i don't like downloading files from strangers

  3. #3
    A.M.S is offline Member
    Join Date
    Dec 2008
    Posts
    17
    Rep Power
    0

    Default

    hmmmm

    I didn't write any code yet.. because i didn't get the idea !!
    the file is a simple PDF file :) and I'm a MAC user, so there's no reason to worry :):)

  4. #4
    A.M.S is offline Member
    Join Date
    Dec 2008
    Posts
    17
    Rep Power
    0

    Default

    this is the problem :





    In this project, you are required to develop a simulator that simulates a sequence of customers arriving in a departmental store and calculates the average waiting time. There are a number of counter queues in the departmental store. Each customer after picking the items, arrives for service, enters a queue, waits for some time, gets service for payment and leaves. The simulator tracks the time the customers spend waiting in queues and outputs the average waiting time.

    Assume that :
    - the time is measured in minutes and the departmental starts the clock with 0 minute and its finish time is MAX (in minutes).
    - arrival time and service time of each customer is provided to the simulator
    - number N of service queues is also provided to the simulator

    Note:
    - Arrival time means the time when the customer joins a counter queue
    - Finish time means the time when he leaves the counter
    - Service time means the time when he deals with the salesperson at the counter
    - Waiting time = Finish time – Arrival Time – Service Time
    - You can generate the arrival time and service times randomly (using Java’s random class) as follows:
    - Randomly generate inter-arrival times ti such that minIAT <= ti <= maxIAT where minIAT means minimum inter-arrival and maxIAT means maximum inter-arival time; these times are specified by the user.
    - Keep the running total of these random times as arrival times
    - Randomly generate service times si such that minST <= si <= maxST, where minST means minimum service time and maximum service time.


    *Suggest a suitable ADT/ADTs for the problem discussed above
    *Give a graphical representation of the ADT/ADTs
    *Give complete specification of the ADT/ADTs

Similar Threads

  1. Implementing a Stack Using two Queues
    By rhm54 in forum New To Java
    Replies: 3
    Last Post: 12-01-2010, 10:28 AM
  2. [SOLVED] Blocking Queues - how?
    By sebo in forum New To Java
    Replies: 4
    Last Post: 12-08-2008, 12:12 PM
  3. Help with Queues in Java
    By Java01 in forum New To Java
    Replies: 3
    Last Post: 11-07-2008, 03:56 PM
  4. Replies: 1
    Last Post: 08-07-2007, 07:05 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •