Define an operation RemoveOperator which takes as input an existing operator who is currently available and removes that operator from the system.

A telecommunications company has set up a 2-tier technical support call centre for assisting its customers. The centre manager is responsible for receiving incoming calls and distributing them to technical operators. The operators are partitioned into two kinds: ordinary and specialist. Ordinary operators deal with basic customer issues; specialist operators deal with advanced customer issues. A new incoming call is by default treated as ordinary. Such a call is either forwarded to an available ordinary operator, providing that such an operator exists, or it is appended at the end of a queue of waiting calls. As soon as an operator of a particular kind becomes available, he/she is ready to receive the first call from the queue of waiting calls that matches his/her kind. An ordinary operator that cannot deal with a call, upgrades the call kind to specialist and either forwards it to an available specialist operator, or places it to the end of the queue of waiting calls if no specialist operator is currently available (in order for the call to be subsequently dealt by a specialist operator). Therefore, the call centre manager is required to keep track of:

  • waiting incoming calls;
  • the kind of each call;
  • the kind of each operator;
  • the operators that are currently available (if any); ▪ which call each operator is currently serving (if any);
  • the number of operators of each kind.

A Z specification of the call centre manager may begin as follows:

 

[Call, Operator]

 

Kind == ordinary | specialist

 

  1. The CallCentre schema should include a number of invariants in addition to the one already provided. Write the formal definitions of the following invariants in terms of predicates:
    • there cannot be available operators whilst there are waiting calls
    • an operator can only serve calls that are of the same kind as the operator – an operator should either be serving a call or be available, not both; – a call can either be served or be in the queue of waiting calls, not both.

[15%]

  1. Using Z schemata specify the following operations:
    1. ServingCallsPerKind. Given a kind, outputs the set of all calls of that kind that are currently being served.

[10%]

  1. Removes an existing waiting call from the queue of waiting calls.

[10%]

  • Handles a new incoming call. The new call should be either forwarded to some available ordinary operator, providing that such an operator exists, or it should be placed at the end of the queue of waiting calls, otherwise. Recall that a new incoming call is by default of kind ordinary.

[15%] iv. Take special care of any errors that may occur; use schema calculus to provide a robust version (say RobustNewCall) of the NewCall operation.

  1. Complete the recursive axiomatic description firstCallOfKind below that takes as inputs: (i) a sequence of calls (say s), (ii) a function (say f) that assigns kinds (either ordinary or specialist) to calls, and (iii) a kind k (either ordinary or specialist). firstCallOfKind returns the value null if s is empty; otherwise, it returns the first call in s whose kind matches, according to the assignments in f, the kind k. Note that f must be applicable to all calls in s, hence the precondition ran s ⊆ dom f. Formally:

firstCallOfKind : seq Call × (Call Kind) × Kind Call ∪ {null}

 

s: seq Call; f: Call Kind; k: Kind ⦁  ran s ⊆ dom f  s = ⟨⟩ ⇒ firstCallOfKind(s, f, k) = null

 …     ⇒  f(head s) = k ⇒ …

              …                  ⇒ …

 

d) Define an operation TerminateCall which removes a call that is currently being served. The operator serving the call:

  • either becomes available, if the queue of waiting calls contains no call which is of the same kind as the terminated call;
  • or starts serving the first waiting call which is of the same kind as the terminated call, otherwise.

In the latter case, the newly-served call is removed from the queue of waiting calls. [HINT:  For the latter case, you may use the axiomatic description firstCallOfKind from 4.a with its 2nd argument (f) being substituted by the function callKind.].

e) Define an operation RemoveOperator which takes as input an existing operator who is currently available and removes that operator from the system. Also, it updates the multiplicities of operator kinds in the system to take this change into account

The post Define an operation RemoveOperator which takes as input an existing operator who is currently available and removes that operator from the system. appeared first on Essay Hotline.

Essaylink
Calculate your paper price
Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

Professional and Experienced Academic Writers

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

24/7 Customer Support

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

Essays

Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.

Admissions

Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.

Reviews

Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.

Reviews

Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.

GIVING 25% DISCOUNT ON ALL YOUR ORDERS

X
WeCreativez WhatsApp Support
Our customer support team is here to answer your questions. Ask us anything!
? Hi, how can I help?